/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/loopv3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:45:44,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:45:44,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:45:44,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:45:44,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:45:44,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:45:44,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:45:44,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:45:44,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:45:44,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:45:44,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:45:44,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:45:44,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:45:44,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:45:44,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:45:44,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:45:44,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:45:44,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:45:44,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:45:44,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:45:44,959 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:45:44,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:45:44,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:45:44,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:45:44,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:45:44,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:45:44,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:45:44,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:45:44,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:45:44,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:45:44,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:45:44,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:45:44,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:45:44,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:45:44,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:45:44,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:45:44,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:45:44,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:45:44,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:45:44,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:45:44,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:45:44,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:45:44,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:45:44,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:45:44,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:45:44,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:45:44,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:45:44,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:45:44,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:45:44,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:45:44,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:45:44,982 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:45:44,982 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:45:45,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:45:45,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:45:45,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:45:45,198 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:45:45,198 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:45:45,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-27 16:45:45,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5842eec53/de7f79ab9e6449528bcd18fd91a87fde/FLAG9d5ce2db1 [2022-04-27 16:45:45,539 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:45:45,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-27 16:45:45,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5842eec53/de7f79ab9e6449528bcd18fd91a87fde/FLAG9d5ce2db1 [2022-04-27 16:45:45,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5842eec53/de7f79ab9e6449528bcd18fd91a87fde [2022-04-27 16:45:45,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:45:45,979 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:45:45,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:45:45,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:45:45,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:45:45,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:45:45" (1/1) ... [2022-04-27 16:45:45,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14658a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:45, skipping insertion in model container [2022-04-27 16:45:45,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:45:45" (1/1) ... [2022-04-27 16:45:45,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:45:45,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:45:46,126 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/loopv3.c[456,469] [2022-04-27 16:45:46,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:45:46,150 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:45:46,159 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/loopv3.c[456,469] [2022-04-27 16:45:46,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:45:46,174 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:45:46,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46 WrapperNode [2022-04-27 16:45:46,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:45:46,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:45:46,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:45:46,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:45:46,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:45:46,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:45:46,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:45:46,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:45:46,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:45:46,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:46,233 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:45:46,250 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:45:46,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:45:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:45:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:45:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:45:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:45:46,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:45:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:45:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:45:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:45:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:45:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:45:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:45:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:45:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:45:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:45:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:45:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:45:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:45:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:45:46,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:45:46,311 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:45:46,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:45:46,427 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:45:46,432 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:45:46,432 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:45:46,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:45:46 BoogieIcfgContainer [2022-04-27 16:45:46,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:45:46,434 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:45:46,434 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:45:46,435 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:45:46,436 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:45:46" (1/1) ... [2022-04-27 16:45:46,438 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:45:46,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:45:46 BasicIcfg [2022-04-27 16:45:46,449 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:45:46,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:45:46,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:45:46,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:45:46,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:45:45" (1/4) ... [2022-04-27 16:45:46,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1d400c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:45:46, skipping insertion in model container [2022-04-27 16:45:46,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:45:46" (2/4) ... [2022-04-27 16:45:46,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1d400c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:45:46, skipping insertion in model container [2022-04-27 16:45:46,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:45:46" (3/4) ... [2022-04-27 16:45:46,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1d400c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:45:46, skipping insertion in model container [2022-04-27 16:45:46,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:45:46" (4/4) ... [2022-04-27 16:45:46,455 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv3.cJordan [2022-04-27 16:45:46,463 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:45:46,464 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:45:46,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:45:46,492 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@2eeb0341, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36255af0 [2022-04-27 16:45:46,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:45:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:45:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:45:46,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:46,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:46,503 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1479494173, now seen corresponding path program 1 times [2022-04-27 16:45:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936724358] [2022-04-27 16:45:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:46,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {24#true} is VALID [2022-04-27 16:45:46,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:45:46,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:45:46,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:46,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {24#true} is VALID [2022-04-27 16:45:46,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:45:46,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:45:46,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:45:46,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {24#true} is VALID [2022-04-27 16:45:46,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [61] L25-2-->L23-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:45:46,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {25#false} is VALID [2022-04-27 16:45:46,727 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {25#false} is VALID [2022-04-27 16:45:46,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [69] __VERIFIER_assertENTRY-->L13: 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] {25#false} is VALID [2022-04-27 16:45:46,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [71] L13-->L14: 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[] {25#false} is VALID [2022-04-27 16:45:46,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:45:46,728 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:45:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:46,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936724358] [2022-04-27 16:45:46,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936724358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:45:46,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:45:46,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:45:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978971171] [2022-04-27 16:45:46,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:45:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:45:46,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:46,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,757 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:45:46,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:45:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:45:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:45:46,787 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:46,862 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 16:45:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:45:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:45:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:45:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:45:46,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-04-27 16:45:46,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:46,910 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:45:46,910 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:45:46,912 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:45:46,914 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 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-27 16:45:46,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:45:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:45:46,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:46,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,936 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,937 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:46,944 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:45:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:45:46,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:46,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:46,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:45:46,946 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:45:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:46,948 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:45:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:45:46,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:46,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:46,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:46,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 16:45:46,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-27 16:45:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:46,953 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 16:45:46,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:45:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:45:46,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:46,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:46,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:45:46,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:46,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1508123324, now seen corresponding path program 1 times [2022-04-27 16:45:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:46,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545178272] [2022-04-27 16:45:46,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:46,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:47,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:47,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#(<= 50000001 ~SIZE~0)} {95#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {102#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:47,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#(<= 50000001 ~SIZE~0)} {95#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {101#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:47,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:45:47,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {96#false} is VALID [2022-04-27 16:45:47,072 INFO L272 TraceCheckUtils]: 8: Hoare triple {96#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {96#false} is VALID [2022-04-27 16:45:47,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} [69] __VERIFIER_assertENTRY-->L13: 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] {96#false} is VALID [2022-04-27 16:45:47,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} [71] L13-->L14: 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[] {96#false} is VALID [2022-04-27 16:45:47,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {96#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:45:47,073 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:45:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545178272] [2022-04-27 16:45:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545178272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:45:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:45:47,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:45:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410069307] [2022-04-27 16:45:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:45:47,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:45:47,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:47,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,105 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:45:47,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:45:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:45:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:45:47,106 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:47,212 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:45:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:45:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:45:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-27 16:45:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-27 16:45:47,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2022-04-27 16:45:47,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:47,249 INFO L225 Difference]: With dead ends: 16 [2022-04-27 16:45:47,249 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 16:45:47,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:45:47,250 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:47,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 16:45:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 16:45:47,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:47,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,253 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,253 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:47,254 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:45:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:45:47,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:47,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:47,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:45:47,255 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:45:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:47,256 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:45:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:45:47,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:47,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:47,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:47,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:45:47,260 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-27 16:45:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:47,261 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:45:47,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:45:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:45:47,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:47,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:47,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:45:47,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:47,262 INFO L85 PathProgramCache]: Analyzing trace with hash 89998238, now seen corresponding path program 1 times [2022-04-27 16:45:47,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:47,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591974676] [2022-04-27 16:45:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:47,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:47,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:47,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:47,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:47,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:47,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {179#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:47,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(<= (+ main_~i~0 49999993) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 16:45:47,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {173#false} is VALID [2022-04-27 16:45:47,363 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {173#false} is VALID [2022-04-27 16:45:47,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} [69] __VERIFIER_assertENTRY-->L13: 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] {173#false} is VALID [2022-04-27 16:45:47,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} [71] L13-->L14: 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[] {173#false} is VALID [2022-04-27 16:45:47,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 16:45:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:47,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591974676] [2022-04-27 16:45:47,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591974676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:47,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925441595] [2022-04-27 16:45:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:47,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:47,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:47,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:45:47,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:45:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:47,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 16:45:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:47,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:45:47,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 16:45:47,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:47,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:47,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:47,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {206#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:47,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 16:45:47,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {173#false} is VALID [2022-04-27 16:45:47,528 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {173#false} is VALID [2022-04-27 16:45:47,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} [69] __VERIFIER_assertENTRY-->L13: 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] {173#false} is VALID [2022-04-27 16:45:47,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} [71] L13-->L14: 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[] {173#false} is VALID [2022-04-27 16:45:47,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 16:45:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:47,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:45:47,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 16:45:47,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} [71] L13-->L14: 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[] {173#false} is VALID [2022-04-27 16:45:47,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} [69] __VERIFIER_assertENTRY-->L13: 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] {173#false} is VALID [2022-04-27 16:45:47,634 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {173#false} is VALID [2022-04-27 16:45:47,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {173#false} is VALID [2022-04-27 16:45:47,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(< main_~i~0 ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-27 16:45:47,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(< (+ main_~i~0 8) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {240#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 16:45:47,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(< (+ main_~i~0 8) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {244#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 16:45:47,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(< 8 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {244#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 16:45:47,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#(< 8 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(< 8 ~SIZE~0)} is VALID [2022-04-27 16:45:47,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#(< 8 ~SIZE~0)} {172#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(< 8 ~SIZE~0)} is VALID [2022-04-27 16:45:47,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#(< 8 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(< 8 ~SIZE~0)} is VALID [2022-04-27 16:45:47,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {251#(< 8 ~SIZE~0)} is VALID [2022-04-27 16:45:47,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-27 16:45:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:47,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925441595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:45:47,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:45:47,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-27 16:45:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391002755] [2022-04-27 16:45:47,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:45:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-27 16:45:47,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:47,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:47,671 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:45:47,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 16:45:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 16:45:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:45:47,675 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:47,853 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 16:45:47,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:45:47,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-27 16:45:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-27 16:45:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-04-27 16:45:47,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2022-04-27 16:45:47,886 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:45:47,888 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:45:47,889 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 16:45:47,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-04-27 16:45:47,892 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 16:45:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 16:45:47,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:47,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,898 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,899 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:47,900 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 16:45:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 16:45:47,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:47,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:47,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 16:45:47,901 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 16:45:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:47,903 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-27 16:45:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 16:45:47,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:47,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:47,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:47,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-27 16:45:47,906 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-04-27 16:45:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:47,906 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-27 16:45:47,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 16:45:47,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 16:45:47,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:47,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:47,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:45:48,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:48,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1261632700, now seen corresponding path program 2 times [2022-04-27 16:45:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:48,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387582114] [2022-04-27 16:45:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:48,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#(<= 50000001 ~SIZE~0)} {363#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:48,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#(<= 50000001 ~SIZE~0)} {363#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {369#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {369#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {369#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {369#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {370#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:48,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {370#(<= (+ main_~i~0 49999993) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {370#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:48,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#(<= (+ main_~i~0 49999993) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {371#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 16:45:48,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#(<= (+ main_~i~0 49999985) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {371#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 16:45:48,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#(<= (+ main_~i~0 49999985) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {372#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 16:45:48,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {372#(<= (+ main_~i~0 49999977) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {372#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 16:45:48,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#(<= (+ main_~i~0 49999977) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {373#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:48,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {373#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-27 16:45:48,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {364#false} is VALID [2022-04-27 16:45:48,269 INFO L272 TraceCheckUtils]: 16: Hoare triple {364#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {364#false} is VALID [2022-04-27 16:45:48,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#false} [69] __VERIFIER_assertENTRY-->L13: 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] {364#false} is VALID [2022-04-27 16:45:48,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#false} [71] L13-->L14: 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[] {364#false} is VALID [2022-04-27 16:45:48,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-27 16:45:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387582114] [2022-04-27 16:45:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387582114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:48,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602610828] [2022-04-27 16:45:48,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:45:48,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:48,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:48,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:45:48,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:45:48,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:45:48,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:45:48,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:45:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:48,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:45:48,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-27 16:45:48,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#(<= 50000001 ~SIZE~0)} {363#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:48,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {393#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {393#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {393#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {393#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {400#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {400#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {407#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {407#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {407#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {414#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {414#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {414#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {414#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {421#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:48,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {421#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-27 16:45:48,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {364#false} is VALID [2022-04-27 16:45:48,588 INFO L272 TraceCheckUtils]: 16: Hoare triple {364#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {364#false} is VALID [2022-04-27 16:45:48,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#false} [69] __VERIFIER_assertENTRY-->L13: 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] {364#false} is VALID [2022-04-27 16:45:48,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#false} [71] L13-->L14: 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[] {364#false} is VALID [2022-04-27 16:45:48,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-27 16:45:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:48,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:45:48,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-27 16:45:48,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#false} [71] L13-->L14: 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[] {364#false} is VALID [2022-04-27 16:45:48,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {364#false} [69] __VERIFIER_assertENTRY-->L13: 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] {364#false} is VALID [2022-04-27 16:45:48,763 INFO L272 TraceCheckUtils]: 16: Hoare triple {364#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {364#false} is VALID [2022-04-27 16:45:48,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {364#false} is VALID [2022-04-27 16:45:48,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#(< main_~i~0 ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {364#false} is VALID [2022-04-27 16:45:48,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {459#(< (+ main_~i~0 8) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {455#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 16:45:48,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(< (+ main_~i~0 8) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {459#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 16:45:48,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {466#(< (+ main_~i~0 16) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {459#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 16:45:48,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(< (+ main_~i~0 16) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {466#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 16:45:48,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(< (+ main_~i~0 24) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {466#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 16:45:48,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(< (+ main_~i~0 24) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {473#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 16:45:48,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(< (+ 32 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {473#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 16:45:48,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#(< (+ 32 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {480#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:48,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#(< 32 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {480#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:48,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#(< 32 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(< 32 ~SIZE~0)} is VALID [2022-04-27 16:45:48,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#(< 32 ~SIZE~0)} {363#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(< 32 ~SIZE~0)} is VALID [2022-04-27 16:45:48,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#(< 32 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(< 32 ~SIZE~0)} is VALID [2022-04-27 16:45:48,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {487#(< 32 ~SIZE~0)} is VALID [2022-04-27 16:45:48,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#true} is VALID [2022-04-27 16:45:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:48,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602610828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:45:48,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:45:48,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-04-27 16:45:48,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220879906] [2022-04-27 16:45:48,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:45:48,771 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-27 16:45:48,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:48,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:48,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:48,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 16:45:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 16:45:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=231, Unknown=0, NotChecked=0, Total=380 [2022-04-27 16:45:48,807 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:49,225 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 16:45:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 16:45:49,226 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-04-27 16:45:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-27 16:45:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 49 transitions. [2022-04-27 16:45:49,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 49 transitions. [2022-04-27 16:45:49,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:49,271 INFO L225 Difference]: With dead ends: 33 [2022-04-27 16:45:49,271 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 16:45:49,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2022-04-27 16:45:49,272 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:49,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:45:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 16:45:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 16:45:49,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:49,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:49,274 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:49,274 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:49,276 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 16:45:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 16:45:49,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:49,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:49,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 16:45:49,277 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 16:45:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:49,280 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 16:45:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 16:45:49,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:49,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:49,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:49,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 16:45:49,282 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2022-04-27 16:45:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:49,282 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 16:45:49,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 16:45:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 16:45:49,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:49,283 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:49,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 16:45:49,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:45:49,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:49,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1413178640, now seen corresponding path program 3 times [2022-04-27 16:45:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:49,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625096231] [2022-04-27 16:45:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:49,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {664#(<= 50000001 ~SIZE~0)} {659#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:49,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {664#(<= 50000001 ~SIZE~0)} {659#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {664#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:49,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {665#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:49,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {665#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {665#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:49,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {665#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {666#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:49,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {666#(<= (+ main_~i~0 49999993) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {666#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:49,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#(<= (+ main_~i~0 49999993) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {667#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 16:45:49,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(<= (+ main_~i~0 49999985) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {667#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 16:45:49,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(<= (+ main_~i~0 49999985) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {668#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 16:45:49,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {668#(<= (+ main_~i~0 49999977) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {668#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 16:45:49,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {668#(<= (+ main_~i~0 49999977) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {669#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {669#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {669#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {669#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {670#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 16:45:49,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#(<= (+ main_~i~0 49999961) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {670#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 16:45:49,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {670#(<= (+ main_~i~0 49999961) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {671#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {671#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {671#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {672#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {672#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {672#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {672#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {673#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 16:45:49,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {673#(<= (+ main_~i~0 49999937) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {673#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 16:45:49,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {673#(<= (+ main_~i~0 49999937) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {674#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {674#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {674#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {674#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {675#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:49,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {675#(<= (+ 49999921 main_~i~0) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {660#false} is VALID [2022-04-27 16:45:49,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {660#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {660#false} is VALID [2022-04-27 16:45:49,700 INFO L272 TraceCheckUtils]: 28: Hoare triple {660#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {660#false} is VALID [2022-04-27 16:45:49,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {660#false} [69] __VERIFIER_assertENTRY-->L13: 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] {660#false} is VALID [2022-04-27 16:45:49,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {660#false} [71] L13-->L14: 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[] {660#false} is VALID [2022-04-27 16:45:49,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {660#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660#false} is VALID [2022-04-27 16:45:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:49,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625096231] [2022-04-27 16:45:49,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625096231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:49,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318829153] [2022-04-27 16:45:49,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 16:45:49,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:49,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:45:49,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 16:45:49,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 16:45:49,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:45:49,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 16:45:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:49,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:45:50,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#true} is VALID [2022-04-27 16:45:50,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:50,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {664#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:50,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {664#(<= 50000001 ~SIZE~0)} {659#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:50,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {664#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {664#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:50,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {664#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {695#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {695#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {695#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {702#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {702#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {702#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {709#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {709#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(and (<= main_~i~0 16) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {716#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {716#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {716#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {716#(and (<= main_~i~0 24) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {723#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {723#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {723#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {723#(and (<= main_~i~0 32) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {730#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {730#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {730#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {730#(and (<= main_~i~0 40) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {737#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {737#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {737#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {737#(and (<= main_~i~0 48) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {744#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {744#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {744#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {744#(and (<= main_~i~0 56) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {751#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {751#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {751#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {751#(and (<= main_~i~0 64) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {758#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {758#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {758#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {758#(and (<= main_~i~0 72) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {765#(and (<= main_~i~0 80) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:50,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {765#(and (<= main_~i~0 80) (<= 50000001 ~SIZE~0))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {660#false} is VALID [2022-04-27 16:45:50,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {660#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {660#false} is VALID [2022-04-27 16:45:50,191 INFO L272 TraceCheckUtils]: 28: Hoare triple {660#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {660#false} is VALID [2022-04-27 16:45:50,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {660#false} [69] __VERIFIER_assertENTRY-->L13: 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] {660#false} is VALID [2022-04-27 16:45:50,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {660#false} [71] L13-->L14: 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[] {660#false} is VALID [2022-04-27 16:45:50,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {660#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660#false} is VALID [2022-04-27 16:45:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:50,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:45:50,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {660#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {660#false} is VALID [2022-04-27 16:45:50,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {660#false} [71] L13-->L14: 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[] {660#false} is VALID [2022-04-27 16:45:50,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {660#false} [69] __VERIFIER_assertENTRY-->L13: 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] {660#false} is VALID [2022-04-27 16:45:50,531 INFO L272 TraceCheckUtils]: 28: Hoare triple {660#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {660#false} is VALID [2022-04-27 16:45:50,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {660#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {660#false} is VALID [2022-04-27 16:45:50,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {799#(< main_~i~0 ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {660#false} is VALID [2022-04-27 16:45:50,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {803#(< (+ main_~i~0 8) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {799#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-27 16:45:50,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {803#(< (+ main_~i~0 8) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {803#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 16:45:50,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {810#(< (+ main_~i~0 16) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {803#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-27 16:45:50,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {810#(< (+ main_~i~0 16) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {810#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 16:45:50,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {817#(< (+ main_~i~0 24) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {810#(< (+ main_~i~0 16) ~SIZE~0)} is VALID [2022-04-27 16:45:50,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {817#(< (+ main_~i~0 24) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {817#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 16:45:50,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {824#(< (+ 32 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {817#(< (+ main_~i~0 24) ~SIZE~0)} is VALID [2022-04-27 16:45:50,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {824#(< (+ 32 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {824#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {831#(< (+ 40 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {824#(< (+ 32 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {831#(< (+ 40 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {831#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#(< (+ main_~i~0 48) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {831#(< (+ 40 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(< (+ main_~i~0 48) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {838#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-27 16:45:50,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#(< (+ 56 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {838#(< (+ main_~i~0 48) ~SIZE~0)} is VALID [2022-04-27 16:45:50,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#(< (+ 56 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {845#(< (+ 56 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {852#(< (+ 64 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {845#(< (+ 56 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {852#(< (+ 64 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {852#(< (+ 64 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {859#(< (+ 72 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {852#(< (+ 64 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {859#(< (+ 72 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {859#(< (+ 72 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(< (+ main_~i~0 80) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {859#(< (+ 72 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:50,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {866#(< (+ main_~i~0 80) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {866#(< (+ main_~i~0 80) ~SIZE~0)} is VALID [2022-04-27 16:45:50,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(< 80 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {866#(< (+ main_~i~0 80) ~SIZE~0)} is VALID [2022-04-27 16:45:50,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(< 80 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(< 80 ~SIZE~0)} is VALID [2022-04-27 16:45:50,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(< 80 ~SIZE~0)} {659#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(< 80 ~SIZE~0)} is VALID [2022-04-27 16:45:50,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(< 80 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {873#(< 80 ~SIZE~0)} is VALID [2022-04-27 16:45:50,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {873#(< 80 ~SIZE~0)} is VALID [2022-04-27 16:45:50,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#true} is VALID [2022-04-27 16:45:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318829153] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:45:50,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:45:50,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-04-27 16:45:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377122657] [2022-04-27 16:45:50,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:45:50,546 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-04-27 16:45:50,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:50,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:50,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:50,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-27 16:45:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:50,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-27 16:45:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=825, Unknown=0, NotChecked=0, Total=1406 [2022-04-27 16:45:50,603 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:51,476 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 16:45:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 16:45:51,476 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-04-27 16:45:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2022-04-27 16:45:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 91 transitions. [2022-04-27 16:45:51,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 91 transitions. [2022-04-27 16:45:51,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:51,554 INFO L225 Difference]: With dead ends: 57 [2022-04-27 16:45:51,554 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 16:45:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1268, Invalid=2392, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 16:45:51,555 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:51,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 24 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:45:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 16:45:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 16:45:51,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:51,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:51,559 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:51,559 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:51,560 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 16:45:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 16:45:51,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:51,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:51,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 16:45:51,561 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 16:45:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:51,563 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2022-04-27 16:45:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 16:45:51,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:51,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:51,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:51,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-04-27 16:45:51,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 32 [2022-04-27 16:45:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:51,565 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-04-27 16:45:51,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 36 states have internal predecessors, (75), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 16:45:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-04-27 16:45:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 16:45:51,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:45:51,566 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:45:51,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 16:45:51,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:51,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:45:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:45:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1302475432, now seen corresponding path program 4 times [2022-04-27 16:45:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:45:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793144304] [2022-04-27 16:45:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:45:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:45:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:45:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:52,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {1194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1170#(<= 50000001 ~SIZE~0)} {1165#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:45:52,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#(<= 50000001 ~SIZE~0)} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1170#(<= 50000001 ~SIZE~0)} {1165#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {1170#(<= 50000001 ~SIZE~0)} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1170#(<= 50000001 ~SIZE~0)} is VALID [2022-04-27 16:45:52,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#(<= 50000001 ~SIZE~0)} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1171#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:52,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {1171#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1171#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-27 16:45:52,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {1171#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1172#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:52,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#(<= (+ main_~i~0 49999993) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1172#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-27 16:45:52,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#(<= (+ main_~i~0 49999993) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1173#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 16:45:52,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {1173#(<= (+ main_~i~0 49999985) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1173#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-27 16:45:52,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {1173#(<= (+ main_~i~0 49999985) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1174#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 16:45:52,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {1174#(<= (+ main_~i~0 49999977) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1174#(<= (+ main_~i~0 49999977) ~SIZE~0)} is VALID [2022-04-27 16:45:52,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#(<= (+ main_~i~0 49999977) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1175#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {1175#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1175#(<= (+ 49999969 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {1175#(<= (+ 49999969 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1176#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 16:45:52,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#(<= (+ main_~i~0 49999961) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1176#(<= (+ main_~i~0 49999961) ~SIZE~0)} is VALID [2022-04-27 16:45:52,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#(<= (+ main_~i~0 49999961) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1177#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1177#(<= (+ 49999953 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {1177#(<= (+ 49999953 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1178#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1178#(<= (+ 49999945 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(<= (+ 49999945 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1179#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 16:45:52,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#(<= (+ main_~i~0 49999937) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1179#(<= (+ main_~i~0 49999937) ~SIZE~0)} is VALID [2022-04-27 16:45:52,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {1179#(<= (+ main_~i~0 49999937) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1180#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {1180#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1180#(<= (+ 49999929 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {1180#(<= (+ 49999929 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1181#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {1181#(<= (+ 49999921 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1181#(<= (+ 49999921 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {1181#(<= (+ 49999921 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1182#(<= (+ 49999913 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {1182#(<= (+ 49999913 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1182#(<= (+ 49999913 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {1182#(<= (+ 49999913 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1183#(<= (+ main_~i~0 49999905) ~SIZE~0)} is VALID [2022-04-27 16:45:52,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {1183#(<= (+ main_~i~0 49999905) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1183#(<= (+ main_~i~0 49999905) ~SIZE~0)} is VALID [2022-04-27 16:45:52,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {1183#(<= (+ main_~i~0 49999905) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1184#(<= (+ main_~i~0 49999897) ~SIZE~0)} is VALID [2022-04-27 16:45:52,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {1184#(<= (+ main_~i~0 49999897) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1184#(<= (+ main_~i~0 49999897) ~SIZE~0)} is VALID [2022-04-27 16:45:52,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {1184#(<= (+ main_~i~0 49999897) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1185#(<= (+ main_~i~0 49999889) ~SIZE~0)} is VALID [2022-04-27 16:45:52,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {1185#(<= (+ main_~i~0 49999889) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1185#(<= (+ main_~i~0 49999889) ~SIZE~0)} is VALID [2022-04-27 16:45:52,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {1185#(<= (+ main_~i~0 49999889) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1186#(<= (+ main_~i~0 49999881) ~SIZE~0)} is VALID [2022-04-27 16:45:52,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#(<= (+ main_~i~0 49999881) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1186#(<= (+ main_~i~0 49999881) ~SIZE~0)} is VALID [2022-04-27 16:45:52,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {1186#(<= (+ main_~i~0 49999881) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1187#(<= (+ 49999873 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {1187#(<= (+ 49999873 main_~i~0) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1187#(<= (+ 49999873 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {1187#(<= (+ 49999873 main_~i~0) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1188#(<= (+ main_~i~0 49999865) ~SIZE~0)} is VALID [2022-04-27 16:45:52,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {1188#(<= (+ main_~i~0 49999865) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1188#(<= (+ main_~i~0 49999865) ~SIZE~0)} is VALID [2022-04-27 16:45:52,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {1188#(<= (+ main_~i~0 49999865) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1189#(<= (+ main_~i~0 49999857) ~SIZE~0)} is VALID [2022-04-27 16:45:52,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {1189#(<= (+ main_~i~0 49999857) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1189#(<= (+ main_~i~0 49999857) ~SIZE~0)} is VALID [2022-04-27 16:45:52,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {1189#(<= (+ main_~i~0 49999857) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1190#(<= (+ main_~i~0 49999849) ~SIZE~0)} is VALID [2022-04-27 16:45:52,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {1190#(<= (+ main_~i~0 49999849) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1190#(<= (+ main_~i~0 49999849) ~SIZE~0)} is VALID [2022-04-27 16:45:52,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {1190#(<= (+ main_~i~0 49999849) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1191#(<= (+ main_~i~0 49999841) ~SIZE~0)} is VALID [2022-04-27 16:45:52,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {1191#(<= (+ main_~i~0 49999841) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1191#(<= (+ main_~i~0 49999841) ~SIZE~0)} is VALID [2022-04-27 16:45:52,235 INFO L290 TraceCheckUtils]: 47: Hoare triple {1191#(<= (+ main_~i~0 49999841) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1192#(<= (+ main_~i~0 49999833) ~SIZE~0)} is VALID [2022-04-27 16:45:52,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {1192#(<= (+ main_~i~0 49999833) ~SIZE~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1192#(<= (+ main_~i~0 49999833) ~SIZE~0)} is VALID [2022-04-27 16:45:52,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {1192#(<= (+ main_~i~0 49999833) ~SIZE~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1193#(<= (+ 49999825 main_~i~0) ~SIZE~0)} is VALID [2022-04-27 16:45:52,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {1193#(<= (+ 49999825 main_~i~0) ~SIZE~0)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1166#false} is VALID [2022-04-27 16:45:52,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {1166#false} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1166#false} is VALID [2022-04-27 16:45:52,236 INFO L272 TraceCheckUtils]: 52: Hoare triple {1166#false} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {1166#false} is VALID [2022-04-27 16:45:52,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {1166#false} [69] __VERIFIER_assertENTRY-->L13: 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] {1166#false} is VALID [2022-04-27 16:45:52,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {1166#false} [71] L13-->L14: 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[] {1166#false} is VALID [2022-04-27 16:45:52,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {1166#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1166#false} is VALID [2022-04-27 16:45:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:52,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:45:52,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793144304] [2022-04-27 16:45:52,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793144304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:52,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064418919] [2022-04-27 16:45:52,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 16:45:52,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:52,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:45:52,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:45:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 16:45:52,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 16:45:52,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:45:52,300 WARN L261 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-27 16:45:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:45:52,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:45:52,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:52,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {1165#true} is VALID [2022-04-27 16:45:52,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:52,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:52,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:52,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1213#(= main_~i~0 0)} is VALID [2022-04-27 16:45:52,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1213#(= main_~i~0 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1213#(= main_~i~0 0)} is VALID [2022-04-27 16:45:52,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {1213#(= main_~i~0 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1220#(= (+ main_~i~0 (- 8)) 0)} is VALID [2022-04-27 16:45:52,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {1220#(= (+ main_~i~0 (- 8)) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1220#(= (+ main_~i~0 (- 8)) 0)} is VALID [2022-04-27 16:45:52,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {1220#(= (+ main_~i~0 (- 8)) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1227#(= (+ (- 16) main_~i~0) 0)} is VALID [2022-04-27 16:45:52,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#(= (+ (- 16) main_~i~0) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1227#(= (+ (- 16) main_~i~0) 0)} is VALID [2022-04-27 16:45:52,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#(= (+ (- 16) main_~i~0) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1234#(= (+ main_~i~0 (- 24)) 0)} is VALID [2022-04-27 16:45:52,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1234#(= (+ main_~i~0 (- 24)) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1234#(= (+ main_~i~0 (- 24)) 0)} is VALID [2022-04-27 16:45:52,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {1234#(= (+ main_~i~0 (- 24)) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1241#(= (+ main_~i~0 (- 32)) 0)} is VALID [2022-04-27 16:45:52,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {1241#(= (+ main_~i~0 (- 32)) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1241#(= (+ main_~i~0 (- 32)) 0)} is VALID [2022-04-27 16:45:52,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1241#(= (+ main_~i~0 (- 32)) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1248#(= (+ (- 40) main_~i~0) 0)} is VALID [2022-04-27 16:45:52,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#(= (+ (- 40) main_~i~0) 0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1248#(= (+ (- 40) main_~i~0) 0)} is VALID [2022-04-27 16:45:52,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {1248#(= (+ (- 40) main_~i~0) 0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1255#(= main_~i~0 48)} is VALID [2022-04-27 16:45:52,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {1255#(= main_~i~0 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1255#(= main_~i~0 48)} is VALID [2022-04-27 16:45:52,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {1255#(= main_~i~0 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1262#(= (+ main_~i~0 (- 8)) 48)} is VALID [2022-04-27 16:45:52,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#(= (+ main_~i~0 (- 8)) 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1262#(= (+ main_~i~0 (- 8)) 48)} is VALID [2022-04-27 16:45:52,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#(= (+ main_~i~0 (- 8)) 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1269#(= (+ (- 16) main_~i~0) 48)} is VALID [2022-04-27 16:45:52,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {1269#(= (+ (- 16) main_~i~0) 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1269#(= (+ (- 16) main_~i~0) 48)} is VALID [2022-04-27 16:45:52,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {1269#(= (+ (- 16) main_~i~0) 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1276#(= (+ main_~i~0 (- 24)) 48)} is VALID [2022-04-27 16:45:52,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {1276#(= (+ main_~i~0 (- 24)) 48)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1276#(= (+ main_~i~0 (- 24)) 48)} is VALID [2022-04-27 16:45:52,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {1276#(= (+ main_~i~0 (- 24)) 48)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1283#(= main_~i~0 80)} is VALID [2022-04-27 16:45:52,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {1283#(= main_~i~0 80)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1283#(= main_~i~0 80)} is VALID [2022-04-27 16:45:52,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {1283#(= main_~i~0 80)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1290#(= (+ main_~i~0 (- 8)) 80)} is VALID [2022-04-27 16:45:52,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {1290#(= (+ main_~i~0 (- 8)) 80)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1290#(= (+ main_~i~0 (- 8)) 80)} is VALID [2022-04-27 16:45:52,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {1290#(= (+ main_~i~0 (- 8)) 80)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1297#(= (+ (- 16) main_~i~0) 80)} is VALID [2022-04-27 16:45:52,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {1297#(= (+ (- 16) main_~i~0) 80)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1297#(= (+ (- 16) main_~i~0) 80)} is VALID [2022-04-27 16:45:52,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {1297#(= (+ (- 16) main_~i~0) 80)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1304#(= 104 main_~i~0)} is VALID [2022-04-27 16:45:52,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {1304#(= 104 main_~i~0)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1304#(= 104 main_~i~0)} is VALID [2022-04-27 16:45:52,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {1304#(= 104 main_~i~0)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1311#(= 104 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 16:45:52,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {1311#(= 104 (+ main_~i~0 (- 8)))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1311#(= 104 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 16:45:52,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {1311#(= 104 (+ main_~i~0 (- 8)))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1318#(= main_~i~0 120)} is VALID [2022-04-27 16:45:52,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {1318#(= main_~i~0 120)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1318#(= main_~i~0 120)} is VALID [2022-04-27 16:45:52,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {1318#(= main_~i~0 120)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1325#(= main_~i~0 128)} is VALID [2022-04-27 16:45:52,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {1325#(= main_~i~0 128)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1325#(= main_~i~0 128)} is VALID [2022-04-27 16:45:52,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {1325#(= main_~i~0 128)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1332#(= (+ main_~i~0 (- 8)) 128)} is VALID [2022-04-27 16:45:52,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {1332#(= (+ main_~i~0 (- 8)) 128)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1332#(= (+ main_~i~0 (- 8)) 128)} is VALID [2022-04-27 16:45:52,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {1332#(= (+ main_~i~0 (- 8)) 128)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1339#(= main_~i~0 144)} is VALID [2022-04-27 16:45:52,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {1339#(= main_~i~0 144)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1339#(= main_~i~0 144)} is VALID [2022-04-27 16:45:52,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {1339#(= main_~i~0 144)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1346#(= 144 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 16:45:52,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {1346#(= 144 (+ main_~i~0 (- 8)))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1346#(= 144 (+ main_~i~0 (- 8)))} is VALID [2022-04-27 16:45:52,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {1346#(= 144 (+ main_~i~0 (- 8)))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1353#(= (+ (- 16) main_~i~0) 144)} is VALID [2022-04-27 16:45:52,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {1353#(= (+ (- 16) main_~i~0) 144)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1353#(= (+ (- 16) main_~i~0) 144)} is VALID [2022-04-27 16:45:52,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {1353#(= (+ (- 16) main_~i~0) 144)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1360#(= main_~i~0 168)} is VALID [2022-04-27 16:45:52,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {1360#(= main_~i~0 168)} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1360#(= main_~i~0 168)} is VALID [2022-04-27 16:45:52,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {1360#(= main_~i~0 168)} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1367#(= (+ main_~i~0 (- 8)) 168)} is VALID [2022-04-27 16:45:52,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {1367#(= (+ main_~i~0 (- 8)) 168)} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1367#(= (+ main_~i~0 (- 8)) 168)} is VALID [2022-04-27 16:45:52,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {1367#(= (+ main_~i~0 (- 8)) 168)} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1374#(and (= (+ main_~i~0 (- 8)) 168) (= main_~j~0 (div main_~i~0 4)))} is VALID [2022-04-27 16:45:52,961 INFO L272 TraceCheckUtils]: 52: Hoare triple {1374#(and (= (+ main_~i~0 (- 8)) 168) (= main_~j~0 (div main_~i~0 4)))} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:45:52,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L13: 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] {1382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:45:52,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {1382#(<= 1 __VERIFIER_assert_~cond)} [71] L13-->L14: 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[] {1166#false} is VALID [2022-04-27 16:45:52,962 INFO L290 TraceCheckUtils]: 55: Hoare triple {1166#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1166#false} is VALID [2022-04-27 16:45:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:45:52,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:45:53,948 INFO L290 TraceCheckUtils]: 55: Hoare triple {1166#false} [73] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1166#false} is VALID [2022-04-27 16:45:53,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {1382#(<= 1 __VERIFIER_assert_~cond)} [71] L13-->L14: 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[] {1166#false} is VALID [2022-04-27 16:45:53,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} [69] __VERIFIER_assertENTRY-->L13: 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] {1382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:45:53,949 INFO L272 TraceCheckUtils]: 52: Hoare triple {1398#(= main_~i~0 (* main_~j~0 4))} [67] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~i~0_12 (* v_main_~j~0_6 4)) 1 0)) InVars {main_~i~0=v_main_~i~0_12, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~i~0] {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:45:53,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [64] L23-2-->L32: Formula: (= (let ((.cse0 (div v_main_~i~0_10 4))) (ite (and (< v_main_~i~0_10 0) (not (= (mod v_main_~i~0_10 4) 0))) (+ .cse0 1) .cse0)) v_main_~j~0_4) InVars {main_~i~0=v_main_~i~0_10} OutVars{main_~i~0=v_main_~i~0_10, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {1398#(= main_~i~0 (* main_~j~0 4))} is VALID [2022-04-27 16:45:53,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [62] L25-2-->L23-2: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,952 INFO L290 TraceCheckUtils]: 48: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,954 INFO L290 TraceCheckUtils]: 43: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [65] L25-->L25-2: Formula: (and (= (+ v_main_~i~0_4 8) v_main_~i~0_3) (not (= |v_main_#t~nondet4_3| 0))) InVars {main_~i~0=v_main_~i~0_4, main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} [63] L25-2-->L25: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (< v_main_~i~0_2 v_~SIZE~0_2) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} [59] mainENTRY-->L25-2: Formula: (and (= v_main_~j~0_1 0) (= v_main_~i~0_7 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1402#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-27 16:45:53,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} [56] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:53,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} [76] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:53,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} [60] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:53,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} [57] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~SIZE~0_3 50000001) (= (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| 2) 9) (= (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] {1165#true} is VALID [2022-04-27 16:45:53,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} [55] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1165#true} is VALID [2022-04-27 16:45:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-27 16:45:53,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064418919] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 16:45:53,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:45:53,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26, 28] total 55 [2022-04-27 16:45:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342871070] [2022-04-27 16:45:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:45:53,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 16:45:53,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:45:53,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:53,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:53,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:45:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:45:53,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:45:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=2580, Unknown=0, NotChecked=0, Total=2970 [2022-04-27 16:45:53,985 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:54,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:54,045 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2022-04-27 16:45:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:45:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 16:45:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:45:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-27 16:45:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-27 16:45:54,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-27 16:45:54,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:45:54,059 INFO L225 Difference]: With dead ends: 55 [2022-04-27 16:45:54,059 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:45:54,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 23 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=394, Invalid=2686, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 16:45:54,060 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:45:54,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:45:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:45:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:45:54,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:45:54,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:54,061 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:54,061 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:54,061 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:45:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:45:54,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:54,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:54,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:45:54,061 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:45:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:45:54,061 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:45:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:45:54,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:54,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:45:54,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:45:54,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:45:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:45:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:45:54,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2022-04-27 16:45:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:45:54,062 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:45:54,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:45:54,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:45:54,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:45:54,064 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:45:54,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 16:45:54,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:45:54,274 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-04-27 16:45:54,275 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:45:54,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:45:54 BasicIcfg [2022-04-27 16:45:54,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:45:54,278 INFO L158 Benchmark]: Toolchain (without parser) took 8299.41ms. Allocated memory was 216.0MB in the beginning and 325.1MB in the end (delta: 109.1MB). Free memory was 167.0MB in the beginning and 189.7MB in the end (delta: -22.6MB). Peak memory consumption was 86.6MB. Max. memory is 8.0GB. [2022-04-27 16:45:54,278 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:45:54,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.69ms. Allocated memory is still 216.0MB. Free memory was 166.8MB in the beginning and 192.5MB in the end (delta: -25.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-27 16:45:54,279 INFO L158 Benchmark]: Boogie Preprocessor took 28.25ms. Allocated memory is still 216.0MB. Free memory was 192.5MB in the beginning and 191.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:45:54,279 INFO L158 Benchmark]: RCFGBuilder took 229.43ms. Allocated memory is still 216.0MB. Free memory was 191.1MB in the beginning and 180.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:45:54,279 INFO L158 Benchmark]: IcfgTransformer took 15.82ms. Allocated memory is still 216.0MB. Free memory was 180.4MB in the beginning and 179.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:45:54,279 INFO L158 Benchmark]: TraceAbstraction took 7826.94ms. Allocated memory was 216.0MB in the beginning and 325.1MB in the end (delta: 109.1MB). Free memory was 178.6MB in the beginning and 189.7MB in the end (delta: -11.1MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. [2022-04-27 16:45:54,280 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 182.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.69ms. Allocated memory is still 216.0MB. Free memory was 166.8MB in the beginning and 192.5MB in the end (delta: -25.7MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.25ms. Allocated memory is still 216.0MB. Free memory was 192.5MB in the beginning and 191.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 229.43ms. Allocated memory is still 216.0MB. Free memory was 191.1MB in the beginning and 180.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.82ms. Allocated memory is still 216.0MB. Free memory was 180.4MB in the beginning and 179.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7826.94ms. Allocated memory was 216.0MB in the beginning and 325.1MB in the end (delta: 109.1MB). Free memory was 178.6MB in the beginning and 189.7MB in the end (delta: -11.1MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 316 IncrementalHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 70 mSDtfsCounter, 316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 164 SyntacticMatches, 23 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2531 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, InterpolantAutomatonStates: 66, 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, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 268 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 1626 SizeOfPredicates, 7 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 484/1803 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:45:54,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...