/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/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 18:57:24,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:57:24,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:57:24,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:57:24,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:57:24,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:57:24,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:57:24,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:57:24,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:57:24,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:57:24,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:57:24,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:57:24,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:57:24,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:57:24,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:57:24,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:57:24,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:57:24,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:57:24,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:57:24,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:57:24,541 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:57:24,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:57:24,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:57:24,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:57:24,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:57:24,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:57:24,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:57:24,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:57:24,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:57:24,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:57:24,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:57:24,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:57:24,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:57:24,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:57:24,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:57:24,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:57:24,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:57:24,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:57:24,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:57:24,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:57:24,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:57:24,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:57:24,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 18:57:24,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:57:24,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:57:24,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:57:24,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:57:24,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:57:24,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:57:24,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:57:24,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:57:24,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:57:24,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:57:24,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:57:24,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:57:24,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:57:24,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:57:24,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:57:24,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:57:24,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 18:57:24,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:57:24,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:57:24,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:57:24,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:57:24,582 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 18:57:24,582 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-14 18:57:24,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:57:24,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:57:24,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:57:24,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:57:24,870 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:57:24,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-14 18:57:24,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e30c9271/8ffdd775879b485ea0f03dbb435689a8/FLAGa54348840 [2022-04-14 18:57:25,385 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:57:25,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2022-04-14 18:57:25,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e30c9271/8ffdd775879b485ea0f03dbb435689a8/FLAGa54348840 [2022-04-14 18:57:25,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e30c9271/8ffdd775879b485ea0f03dbb435689a8 [2022-04-14 18:57:25,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:57:25,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 18:57:25,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:57:25,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:57:25,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:57:25,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e092e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25, skipping insertion in model container [2022-04-14 18:57:25,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:57:25,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:57:25,643 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/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-14 18:57:25,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:57:25,675 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:57:25,690 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/sum01_bug02_sum01_bug02_base.case.i[834,847] [2022-04-14 18:57:25,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:57:25,718 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:57:25,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25 WrapperNode [2022-04-14 18:57:25,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:57:25,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:57:25,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:57:25,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:57:25,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:57:25,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:57:25,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:57:25,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:57:25,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (1/1) ... [2022-04-14 18:57:25,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:57:25,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:25,801 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-14 18:57:25,826 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-14 18:57:25,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:57:25,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:57:25,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:57:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 18:57:25,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:57:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:57:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:57:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 18:57:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 18:57:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:57:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:57:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 18:57:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 18:57:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:57:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:57:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:57:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:57:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:57:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:57:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:57:25,921 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:57:25,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:57:26,100 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:57:26,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:57:26,107 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 18:57:26,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:57:26 BoogieIcfgContainer [2022-04-14 18:57:26,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:57:26,109 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 18:57:26,109 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 18:57:26,110 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 18:57:26,129 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:57:26" (1/1) ... [2022-04-14 18:57:26,131 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 18:57:26,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:57:26 BasicIcfg [2022-04-14 18:57:26,148 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 18:57:26,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:57:26,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:57:26,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:57:26,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:57:25" (1/4) ... [2022-04-14 18:57:26,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65082613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:57:26, skipping insertion in model container [2022-04-14 18:57:26,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:57:25" (2/4) ... [2022-04-14 18:57:26,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65082613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:57:26, skipping insertion in model container [2022-04-14 18:57:26,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:57:26" (3/4) ... [2022-04-14 18:57:26,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65082613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:57:26, skipping insertion in model container [2022-04-14 18:57:26,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 06:57:26" (4/4) ... [2022-04-14 18:57:26,155 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.iJordan [2022-04-14 18:57:26,166 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:57:26,167 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:57:26,215 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:57:26,228 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 18:57:26,228 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:57:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-14 18:57:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 18:57:26,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:26,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:26,256 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:26,263 INFO L85 PathProgramCache]: Analyzing trace with hash -423489079, now seen corresponding path program 1 times [2022-04-14 18:57:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:26,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491198893] [2022-04-14 18:57:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 18:57:26,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:26,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:26,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:26,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 18:57:26,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:26,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:26,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 18:57:26,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-14 18:57:26,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 18:57:26,496 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {24#false} is VALID [2022-04-14 18:57:26,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [63] __VERIFIER_assertENTRY-->L15: 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] {24#false} is VALID [2022-04-14 18:57:26,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [65] L15-->L16: 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[] {24#false} is VALID [2022-04-14 18:57:26,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 18:57:26,497 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-14 18:57:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:26,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491198893] [2022-04-14 18:57:26,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491198893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:57:26,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:57:26,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 18:57:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201739138] [2022-04-14 18:57:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:57:26,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 18:57:26,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:26,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:26,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:26,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 18:57:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 18:57:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 18:57:26,574 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:26,634 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 18:57:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 18:57:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 18:57:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 18:57:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 18:57:26,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 18:57:26,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:26,684 INFO L225 Difference]: With dead ends: 20 [2022-04-14 18:57:26,684 INFO L226 Difference]: Without dead ends: 14 [2022-04-14 18:57:26,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 18:57:26,689 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:26,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:57:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-14 18:57:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-14 18:57:26,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:26,714 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-14 18:57:26,715 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-14 18:57:26,715 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-14 18:57:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:26,718 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-14 18:57:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 18:57:26,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:26,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:26,719 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-14 18:57:26,719 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-14 18:57:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:26,725 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-14 18:57:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 18:57:26,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:26,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:26,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:26,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:26,727 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-14 18:57:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-14 18:57:26,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-14 18:57:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:26,733 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-14 18:57:26,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-14 18:57:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 18:57:26,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:26,734 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:26,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:57:26,734 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:26,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash -422565558, now seen corresponding path program 1 times [2022-04-14 18:57:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:26,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116634897] [2022-04-14 18:57:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:26,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:26,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-14 18:57:26,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-14 18:57:26,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93#true} {93#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-14 18:57:26,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {93#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:26,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-04-14 18:57:26,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-14 18:57:26,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93#true} {93#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-14 18:57:26,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {93#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-14 18:57:26,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:26,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:26,866 INFO L272 TraceCheckUtils]: 7: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {99#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 18:57:26,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {99#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L15: 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] {100#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 18:57:26,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {100#(not (= __VERIFIER_assert_~cond 0))} [65] L15-->L16: 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[] {94#false} is VALID [2022-04-14 18:57:26,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {94#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-14 18:57:26,868 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-14 18:57:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:26,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116634897] [2022-04-14 18:57:26,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116634897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:57:26,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:57:26,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 18:57:26,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594633714] [2022-04-14 18:57:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:57:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 18:57:26,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:26,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:26,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:26,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 18:57:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:26,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 18:57:26,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 18:57:26,884 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:27,006 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-14 18:57:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 18:57:27,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 18:57:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-14 18:57:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-14 18:57:27,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-14 18:57:27,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:27,033 INFO L225 Difference]: With dead ends: 18 [2022-04-14 18:57:27,033 INFO L226 Difference]: Without dead ends: 15 [2022-04-14 18:57:27,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 18:57:27,035 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:27,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:57:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-14 18:57:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-14 18:57:27,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:27,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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-14 18:57:27,038 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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-14 18:57:27,039 INFO L87 Difference]: Start difference. First operand 15 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-14 18:57:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:27,040 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-14 18:57:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-14 18:57:27,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:27,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:27,041 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 15 states. [2022-04-14 18:57:27,041 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 15 states. [2022-04-14 18:57:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:27,042 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-14 18:57:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-14 18:57:27,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:27,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:27,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:27,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:27,043 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-14 18:57:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-14 18:57:27,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-14 18:57:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:27,045 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-14 18:57:27,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-14 18:57:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 18:57:27,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:27,046 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:27,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 18:57:27,046 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:27,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1744981802, now seen corresponding path program 1 times [2022-04-14 18:57:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:27,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669446571] [2022-04-14 18:57:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:27,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-14 18:57:27,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 18:57:27,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 18:57:27,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:27,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {173#true} is VALID [2022-04-14 18:57:27,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 18:57:27,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 18:57:27,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-14 18:57:27,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {178#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-14 18:57:27,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {178#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-14 18:57:27,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(= (+ (- 1) main_~i~0) 0)} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {174#false} is VALID [2022-04-14 18:57:27,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {174#false} is VALID [2022-04-14 18:57:27,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 18:57:27,105 INFO L272 TraceCheckUtils]: 10: Hoare triple {174#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {174#false} is VALID [2022-04-14 18:57:27,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} [63] __VERIFIER_assertENTRY-->L15: 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] {174#false} is VALID [2022-04-14 18:57:27,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#false} [65] L15-->L16: 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[] {174#false} is VALID [2022-04-14 18:57:27,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-14 18:57:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:27,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:27,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669446571] [2022-04-14 18:57:27,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669446571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:57:27,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:57:27,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:57:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399708427] [2022-04-14 18:57:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:57:27,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 18:57:27,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:27,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,128 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-14 18:57:27,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:57:27,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:57:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:57:27,137 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:27,203 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-14 18:57:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:57:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 18:57:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-14 18:57:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-14 18:57:27,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-14 18:57:27,232 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-14 18:57:27,234 INFO L225 Difference]: With dead ends: 17 [2022-04-14 18:57:27,234 INFO L226 Difference]: Without dead ends: 17 [2022-04-14 18:57:27,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:57:27,240 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:27,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:57:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-14 18:57:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-14 18:57:27,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:27,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-14 18:57:27,247 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-14 18:57:27,249 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-14 18:57:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:27,251 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-14 18:57:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-14 18:57:27,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:27,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:27,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-14 18:57:27,253 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-14 18:57:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:27,255 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-14 18:57:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-14 18:57:27,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:27,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:27,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:27,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-14 18:57:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-14 18:57:27,259 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-14 18:57:27,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:27,260 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-14 18:57:27,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-14 18:57:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 18:57:27,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:27,262 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:27,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 18:57:27,262 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash -857478121, now seen corresponding path program 1 times [2022-04-14 18:57:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:27,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462389801] [2022-04-14 18:57:27,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:27,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:27,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {251#true} is VALID [2022-04-14 18:57:27,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:27,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {251#true} is VALID [2022-04-14 18:57:27,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {256#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 18:57:27,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {257#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-14 18:57:27,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {257#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-14 18:57:27,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {258#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-14 18:57:27,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {259#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:27,520 INFO L272 TraceCheckUtils]: 10: Hoare triple {259#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {260#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 18:57:27,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L15: 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] {261#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 18:57:27,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {261#(not (= __VERIFIER_assert_~cond 0))} [65] L15-->L16: 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[] {252#false} is VALID [2022-04-14 18:57:27,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-14 18:57:27,522 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-14 18:57:27,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:27,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462389801] [2022-04-14 18:57:27,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462389801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:57:27,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600139455] [2022-04-14 18:57:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:27,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:27,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:27,525 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-14 18:57:27,561 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-14 18:57:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:27,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 18:57:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:27,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:57:27,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {251#true} is VALID [2022-04-14 18:57:27,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:27,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {256#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 18:57:27,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {284#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 18:57:27,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {284#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 18:57:27,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(and (<= main_~i~0 main_~n~0) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {291#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} is VALID [2022-04-14 18:57:27,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (<= main_~i~0 2))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {295#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} is VALID [2022-04-14 18:57:27,931 INFO L272 TraceCheckUtils]: 10: Hoare triple {295#(and (<= 1 main_~n~0) (= 2 main_~sn~0) (< main_~n~0 2))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 18:57:27,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 18:57:27,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {252#false} is VALID [2022-04-14 18:57:27,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-14 18:57:27,933 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-14 18:57:27,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:57:28,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {252#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-14 18:57:28,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {252#false} is VALID [2022-04-14 18:57:28,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {303#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 18:57:28,229 INFO L272 TraceCheckUtils]: 10: Hoare triple {319#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {299#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 18:57:28,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {319#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:28,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {323#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:28,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {327#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:28,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {327#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:28,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {334#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:28,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:28,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:28,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:28,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {251#true} is VALID [2022-04-14 18:57:28,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#true} is VALID [2022-04-14 18:57:28,241 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-14 18:57:28,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600139455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:57:28,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:57:28,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-14 18:57:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385825612] [2022-04-14 18:57:28,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:57:28,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 18:57:28,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:28,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:28,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:28,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 18:57:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 18:57:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-14 18:57:28,277 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:28,762 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-14 18:57:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 18:57:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 18:57:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-14 18:57:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-14 18:57:28,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-04-14 18:57:28,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:28,799 INFO L225 Difference]: With dead ends: 26 [2022-04-14 18:57:28,799 INFO L226 Difference]: Without dead ends: 22 [2022-04-14 18:57:28,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-14 18:57:28,801 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:28,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 18:57:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-14 18:57:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-14 18:57:28,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:28,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-14 18:57:28,804 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-14 18:57:28,804 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-14 18:57:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:28,805 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-14 18:57:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-14 18:57:28,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:28,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:28,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 22 states. [2022-04-14 18:57:28,806 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 22 states. [2022-04-14 18:57:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:28,808 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-14 18:57:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-14 18:57:28,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:28,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:28,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:28,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-14 18:57:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-14 18:57:28,810 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2022-04-14 18:57:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:28,810 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-14 18:57:28,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-14 18:57:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-14 18:57:28,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:28,811 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:28,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 18:57:29,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:29,036 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -308814103, now seen corresponding path program 1 times [2022-04-14 18:57:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:29,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012978689] [2022-04-14 18:57:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:29,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {464#true} is VALID [2022-04-14 18:57:29,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {464#true} {464#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:29,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {464#true} is VALID [2022-04-14 18:57:29,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {469#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-14 18:57:29,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {469#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-14 18:57:29,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#(= (+ (- 1) main_~i~0) 0)} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {469#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-14 18:57:29,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 2)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 2)} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {465#false} is VALID [2022-04-14 18:57:29,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {465#false} is VALID [2022-04-14 18:57:29,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {465#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {465#false} is VALID [2022-04-14 18:57:29,097 INFO L272 TraceCheckUtils]: 13: Hoare triple {465#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {465#false} is VALID [2022-04-14 18:57:29,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {465#false} [63] __VERIFIER_assertENTRY-->L15: 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] {465#false} is VALID [2022-04-14 18:57:29,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {465#false} [65] L15-->L16: 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[] {465#false} is VALID [2022-04-14 18:57:29,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#false} is VALID [2022-04-14 18:57:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:29,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012978689] [2022-04-14 18:57:29,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012978689] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:57:29,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744928434] [2022-04-14 18:57:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:29,099 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-14 18:57:29,101 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-14 18:57:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:29,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 18:57:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:29,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:57:29,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {464#true} is VALID [2022-04-14 18:57:29,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {490#(<= main_~i~0 1)} is VALID [2022-04-14 18:57:29,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(<= main_~i~0 1)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {490#(<= main_~i~0 1)} is VALID [2022-04-14 18:57:29,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(<= main_~i~0 1)} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {490#(<= main_~i~0 1)} is VALID [2022-04-14 18:57:29,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(<= main_~i~0 2)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#(<= main_~i~0 2)} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {465#false} is VALID [2022-04-14 18:57:29,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {465#false} is VALID [2022-04-14 18:57:29,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {465#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {465#false} is VALID [2022-04-14 18:57:29,221 INFO L272 TraceCheckUtils]: 13: Hoare triple {465#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {465#false} is VALID [2022-04-14 18:57:29,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {465#false} [63] __VERIFIER_assertENTRY-->L15: 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] {465#false} is VALID [2022-04-14 18:57:29,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {465#false} [65] L15-->L16: 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[] {465#false} is VALID [2022-04-14 18:57:29,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#false} is VALID [2022-04-14 18:57:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:29,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:57:29,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {465#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {465#false} is VALID [2022-04-14 18:57:29,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {465#false} [65] L15-->L16: 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[] {465#false} is VALID [2022-04-14 18:57:29,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {465#false} [63] __VERIFIER_assertENTRY-->L15: 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] {465#false} is VALID [2022-04-14 18:57:29,319 INFO L272 TraceCheckUtils]: 13: Hoare triple {465#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {465#false} is VALID [2022-04-14 18:57:29,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {465#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {465#false} is VALID [2022-04-14 18:57:29,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#false} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {465#false} is VALID [2022-04-14 18:57:29,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#(not (<= 4 main_~i~0))} [60] L26-->L24-2: Formula: (and (= v_main_~sn~0_1 (- 10)) (= v_main_~i~0_1 4)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {465#false} is VALID [2022-04-14 18:57:29,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#(not (<= 4 main_~i~0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {542#(not (<= 4 main_~i~0))} is VALID [2022-04-14 18:57:29,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {542#(not (<= 4 main_~i~0))} is VALID [2022-04-14 18:57:29,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(<= main_~i~0 2)} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(<= main_~i~0 2)} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {470#(<= main_~i~0 2)} is VALID [2022-04-14 18:57:29,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {464#true} is VALID [2022-04-14 18:57:29,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {464#true} is VALID [2022-04-14 18:57:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:29,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744928434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:57:29,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:57:29,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-14 18:57:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724747901] [2022-04-14 18:57:29,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:57:29,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 18:57:29,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:29,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:29,346 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-14 18:57:29,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 18:57:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:29,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 18:57:29,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-14 18:57:29,347 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:29,445 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 18:57:29,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 18:57:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-14 18:57:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-14 18:57:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-14 18:57:29,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-14 18:57:29,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:29,472 INFO L225 Difference]: With dead ends: 23 [2022-04-14 18:57:29,472 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 18:57:29,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-04-14 18:57:29,473 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:29,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 18:57:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 18:57:29,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-14 18:57:29,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:29,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-14 18:57:29,476 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-14 18:57:29,476 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-14 18:57:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:29,477 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 18:57:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 18:57:29,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:29,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:29,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 23 states. [2022-04-14 18:57:29,478 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 23 states. [2022-04-14 18:57:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:29,479 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-14 18:57:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-14 18:57:29,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:29,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:29,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:29,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-14 18:57:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-14 18:57:29,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-14 18:57:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:29,481 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-14 18:57:29,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-14 18:57:29,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 18:57:29,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:29,482 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:29,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 18:57:29,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:29,696 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:29,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1013592265, now seen corresponding path program 2 times [2022-04-14 18:57:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:29,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459003265] [2022-04-14 18:57:29,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:29,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:57:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:29,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {672#true} is VALID [2022-04-14 18:57:29,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:29,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {672#true} {672#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:29,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {672#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 18:57:29,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {672#true} is VALID [2022-04-14 18:57:29,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:29,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#true} {672#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:29,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:29,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {677#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 18:57:29,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:29,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:29,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {679#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-14 18:57:29,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {680#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:29,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {680#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:29,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {680#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {679#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-14 18:57:29,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {681#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-14 18:57:29,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {681#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {681#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-14 18:57:29,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {681#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {682#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-14 18:57:29,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {682#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {683#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:29,969 INFO L272 TraceCheckUtils]: 16: Hoare triple {683#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {684#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 18:57:29,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {684#(not (= |__VERIFIER_assert_#in~cond| 0))} [63] __VERIFIER_assertENTRY-->L15: 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] {685#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 18:57:29,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {685#(not (= __VERIFIER_assert_~cond 0))} [65] L15-->L16: 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[] {673#false} is VALID [2022-04-14 18:57:29,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {673#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {673#false} is VALID [2022-04-14 18:57:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 18:57:29,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:57:29,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459003265] [2022-04-14 18:57:29,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459003265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 18:57:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498705800] [2022-04-14 18:57:29,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 18:57:29,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:29,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:57:29,972 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-14 18:57:30,001 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-14 18:57:30,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 18:57:30,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 18:57:30,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 18:57:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:57:30,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 18:57:30,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {672#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:30,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {672#true} is VALID [2022-04-14 18:57:30,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:30,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#true} {672#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:30,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:30,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {677#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 18:57:30,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:30,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:30,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {714#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-14 18:57:30,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {718#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-14 18:57:30,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {718#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {718#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} is VALID [2022-04-14 18:57:30,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {718#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {725#(and (<= 4 main_~sn~0) (= main_~i~0 3) (<= main_~sn~0 4))} is VALID [2022-04-14 18:57:30,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {725#(and (<= 4 main_~sn~0) (= main_~i~0 3) (<= main_~sn~0 4))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {729#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} is VALID [2022-04-14 18:57:30,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {729#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {729#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} is VALID [2022-04-14 18:57:30,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {729#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {736#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-14 18:57:30,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {736#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {740#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-14 18:57:30,571 INFO L272 TraceCheckUtils]: 16: Hoare triple {740#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 18:57:30,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {744#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 18:57:30,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {748#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {673#false} is VALID [2022-04-14 18:57:30,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {673#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {673#false} is VALID [2022-04-14 18:57:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:30,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 18:57:31,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {673#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {673#false} is VALID [2022-04-14 18:57:31,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {748#(<= 1 __VERIFIER_assert_~cond)} [65] L15-->L16: 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[] {673#false} is VALID [2022-04-14 18:57:31,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {744#(<= 1 |__VERIFIER_assert_#in~cond|)} [63] __VERIFIER_assertENTRY-->L15: 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] {748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 18:57:31,147 INFO L272 TraceCheckUtils]: 16: Hoare triple {764#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_6 (* v_main_~n~0_5 2)) (= v_main_~sn~0_6 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_6, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 18:57:31,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {768#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {764#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:31,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {772#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {768#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:31,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {772#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:31,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {779#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {772#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-14 18:57:31,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {779#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:31,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {783#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {783#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:31,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {783#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-14 18:57:31,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {790#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-14 18:57:31,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [61] L26-->L24-2: Formula: (not (= v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {794#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-14 18:57:31,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [58] L24-3-->L26: Formula: (and (= v_main_~sn~0_4 (+ v_main_~sn~0_5 2)) (<= v_main_~i~0_9 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_5} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4, main_~sn~0=v_main_~sn~0_4} AuxVars[] AssignedVars[main_~sn~0] {794#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-14 18:57:31,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_2 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_2} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {801#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-14 18:57:31,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:31,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#true} {672#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:31,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:31,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} [52] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 36) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {672#true} is VALID [2022-04-14 18:57:31,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {672#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {672#true} is VALID [2022-04-14 18:57:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:57:31,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498705800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 18:57:31,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 18:57:31,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-14 18:57:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070979316] [2022-04-14 18:57:31,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 18:57:31,167 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 18:57:31,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:57:31,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:31,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:31,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-14 18:57:31,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:57:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-14 18:57:31,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2022-04-14 18:57:31,214 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:32,162 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-14 18:57:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-14 18:57:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-14 18:57:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:57:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2022-04-14 18:57:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2022-04-14 18:57:32,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 36 transitions. [2022-04-14 18:57:32,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:57:32,201 INFO L225 Difference]: With dead ends: 32 [2022-04-14 18:57:32,201 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 18:57:32,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-04-14 18:57:32,202 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:57:32,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 81 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 18:57:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 18:57:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-14 18:57:32,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:57:32,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-14 18:57:32,205 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-14 18:57:32,205 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-14 18:57:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:32,207 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-14 18:57:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-14 18:57:32,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:32,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:32,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 28 states. [2022-04-14 18:57:32,208 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 28 states. [2022-04-14 18:57:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:57:32,209 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-14 18:57:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-14 18:57:32,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:57:32,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:57:32,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:57:32,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:57:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-14 18:57:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-14 18:57:32,211 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-14 18:57:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:57:32,211 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-14 18:57:32,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:57:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 18:57:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 18:57:32,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:57:32,212 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:57:32,233 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-14 18:57:32,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 18:57:32,428 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:57:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:57:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 344303561, now seen corresponding path program 2 times [2022-04-14 18:57:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:57:32,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144878589] [2022-04-14 18:57:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:57:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:57:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:57:32,473 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 18:57:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:57:32,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 18:57:32,512 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 18:57:32,513 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 18:57:32,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 18:57:32,518 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-04-14 18:57:32,521 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 18:57:32,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:57:32 BasicIcfg [2022-04-14 18:57:32,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 18:57:32,547 INFO L158 Benchmark]: Toolchain (without parser) took 7134.08ms. Allocated memory was 176.2MB in the beginning and 219.2MB in the end (delta: 43.0MB). Free memory was 127.3MB in the beginning and 86.6MB in the end (delta: 40.7MB). Peak memory consumption was 84.7MB. Max. memory is 8.0GB. [2022-04-14 18:57:32,547 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:57:32,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.38ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 151.9MB in the end (delta: -24.9MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-14 18:57:32,548 INFO L158 Benchmark]: Boogie Preprocessor took 43.22ms. Allocated memory is still 176.2MB. Free memory was 151.9MB in the beginning and 150.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 18:57:32,548 INFO L158 Benchmark]: RCFGBuilder took 344.85ms. Allocated memory is still 176.2MB. Free memory was 150.3MB in the beginning and 139.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 18:57:32,548 INFO L158 Benchmark]: IcfgTransformer took 38.73ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 138.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 18:57:32,548 INFO L158 Benchmark]: TraceAbstraction took 6396.80ms. Allocated memory was 176.2MB in the beginning and 219.2MB in the end (delta: 43.0MB). Free memory was 137.7MB in the beginning and 86.6MB in the end (delta: 51.1MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. [2022-04-14 18:57:32,551 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.17ms. Allocated memory is still 176.2MB. Free memory was 143.6MB in the beginning and 143.5MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 302.38ms. Allocated memory is still 176.2MB. Free memory was 127.0MB in the beginning and 151.9MB in the end (delta: -24.9MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.22ms. Allocated memory is still 176.2MB. Free memory was 151.9MB in the beginning and 150.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 344.85ms. Allocated memory is still 176.2MB. Free memory was 150.3MB in the beginning and 139.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 38.73ms. Allocated memory is still 176.2MB. Free memory was 139.3MB in the beginning and 138.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6396.80ms. Allocated memory was 176.2MB in the beginning and 219.2MB in the end (delta: 43.0MB). Free memory was 137.7MB in the beginning and 86.6MB in the end (delta: 51.1MB). Peak memory consumption was 94.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 VAL [i=1, n=4, n=0] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=1, n=2, n=4] [L26] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L24] i++ VAL [i=2, n=4, n=2] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=2, n=4, n=4] [L26] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L24] i++ VAL [i=3, n=4, n=4] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=3, n=6, n=4] [L26] COND FALSE !(i==4) VAL [i=3, n=4, n=6] [L24] i++ VAL [i=4, n=4, n=6] [L24] COND TRUE i<=n [L25] sn = sn + (2) VAL [i=4, n=4, n=8] [L26] COND TRUE i==4 [L26] sn=-10 VAL [i=4, n=4, n=-10] [L24] i++ VAL [i=5, n=4, n=-10] [L24] COND FALSE !(i<=n) VAL [i=5, n=4, n=-10] [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 444 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 74 mSDtfsCounter, 444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1017 SizeOfPredicates, 6 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 11/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 18:57:32,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...