/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:48:38,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:48:38,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:48:38,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:48:38,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:48:38,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:48:38,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:48:38,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:48:38,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:48:38,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:48:38,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:48:38,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:48:38,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:48:38,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:48:38,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:48:38,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:48:38,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:48:38,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:48:38,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:48:38,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:48:38,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:48:38,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:48:38,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:48:38,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:48:38,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:48:38,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:48:38,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:48:38,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:48:38,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:48:38,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:48:38,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:48:38,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:48:38,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:48:38,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:48:38,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:48:38,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:48:38,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:48:38,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:48:38,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:48:38,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:48:38,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:48:38,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:48:38,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:48:38,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:48:38,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:48:38,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:48:38,787 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:48:38,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:48:38,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:48:38,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:48:38,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:48:38,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:48:38,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:48:38,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:48:38,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:48:38,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:48:38,790 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:48:38,790 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:48:38,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:48:38,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:48:38,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:48:38,981 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:48:38,985 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:48:38,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-27 16:48:39,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb70bafa1/6bf7927339964776be687b23cffeb1a1/FLAG6e6ed02a5 [2022-04-27 16:48:39,385 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:48:39,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2022-04-27 16:48:39,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb70bafa1/6bf7927339964776be687b23cffeb1a1/FLAG6e6ed02a5 [2022-04-27 16:48:39,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb70bafa1/6bf7927339964776be687b23cffeb1a1 [2022-04-27 16:48:39,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:48:39,399 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:48:39,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:48:39,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:48:39,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:48:39,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170172f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39, skipping insertion in model container [2022-04-27 16:48:39,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:48:39,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:48:39,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c[319,332] [2022-04-27 16:48:39,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:48:39,593 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:48:39,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c[319,332] [2022-04-27 16:48:39,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:48:39,616 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:48:39,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39 WrapperNode [2022-04-27 16:48:39,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:48:39,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:48:39,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:48:39,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:48:39,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:48:39,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:48:39,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:48:39,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:48:39,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:48:39,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:48:39,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:48:39,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:48:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:48:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:48:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:48:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:48:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:48:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:48:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:48:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:48:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:48:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:48:39,776 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:48:39,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:48:39,884 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:48:39,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:48:39,888 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:48:39,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:48:39 BoogieIcfgContainer [2022-04-27 16:48:39,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:48:39,890 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:48:39,890 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:48:39,891 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:48:39,895 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:48:39" (1/1) ... [2022-04-27 16:48:39,896 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:48:39,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:48:39 BasicIcfg [2022-04-27 16:48:39,907 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:48:39,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:48:39,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:48:39,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:48:39,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:48:39" (1/4) ... [2022-04-27 16:48:39,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fcac67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:48:39, skipping insertion in model container [2022-04-27 16:48:39,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:48:39" (2/4) ... [2022-04-27 16:48:39,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fcac67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:48:39, skipping insertion in model container [2022-04-27 16:48:39,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:48:39" (3/4) ... [2022-04-27 16:48:39,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52fcac67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:48:39, skipping insertion in model container [2022-04-27 16:48:39,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:48:39" (4/4) ... [2022-04-27 16:48:39,912 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.cJordan [2022-04-27 16:48:39,920 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:48:39,920 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:48:39,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:48:39,948 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@196a26, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2692aff3 [2022-04-27 16:48:39,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:48:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:48:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:48:39,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:48:39,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:48:39,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:48:39,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:48:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-27 16:48:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:48:39,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116321569] [2022-04-27 16:48:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:48:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:48:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:48:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:48:40,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:48:40,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:48:40,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:48:40,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:48:40,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:48:40,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:48:40,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:48:40,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {24#true} is VALID [2022-04-27 16:48:40,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L10-2-->L10-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:48:40,105 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {25#false} is VALID [2022-04-27 16:48:40,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 16:48:40,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:48:40,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:48:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:48:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:48:40,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116321569] [2022-04-27 16:48:40,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116321569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:48:40,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:48:40,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:48:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157410173] [2022-04-27 16:48:40,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:48:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:48:40,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:48:40,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:40,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:48:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:48:40,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:48:40,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:48:40,155 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,209 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 16:48:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:48:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:48:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:48:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:48:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-04-27 16:48:40,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-04-27 16:48:40,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:40,261 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:48:40,262 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:48:40,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:48:40,266 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:48:40,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:48:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:48:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:48:40,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:48:40,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,286 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,286 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,290 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:48:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:48:40,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:40,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:40,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:48:40,292 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 16:48:40,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,296 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:48:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:48:40,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:40,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:40,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:48:40,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:48:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 16:48:40,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 16:48:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:48:40,298 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 16:48:40,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:48:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:48:40,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:48:40,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:48:40,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:48:40,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:48:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:48:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-27 16:48:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:48:40,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724247720] [2022-04-27 16:48:40,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:48:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:48:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:48:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:48:40,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:48:40,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:48:40,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:48:40,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:48:40,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:48:40,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:48:40,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:48:40,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {100#(= main_~z~0 0)} is VALID [2022-04-27 16:48:40,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#(= main_~z~0 0)} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {100#(= main_~z~0 0)} is VALID [2022-04-27 16:48:40,417 INFO L272 TraceCheckUtils]: 7: Hoare triple {100#(= main_~z~0 0)} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {101#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:48:40,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {101#(not (= |__VERIFIER_assert_#in~cond| 0))} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {102#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:48:40,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {102#(not (= __VERIFIER_assert_~cond 0))} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:48:40,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:48:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:48:40,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:48:40,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724247720] [2022-04-27 16:48:40,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724247720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:48:40,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:48:40,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:48:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924955337] [2022-04-27 16:48:40,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:48:40,421 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-27 16:48:40,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:48:40,432 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-27 16:48:40,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:40,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:48:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:48:40,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:48:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:48:40,445 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-27 16:48:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,562 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 16:48:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:48:40,562 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-27 16:48:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:48:40,565 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-27 16:48:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-27 16:48:40,568 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-27 16:48:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-27 16:48:40,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-27 16:48:40,594 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-27 16:48:40,596 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:48:40,596 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 16:48:40,597 INFO L412 NwaCegarLoop]: 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-27 16:48:40,599 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:48:40,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:48:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 16:48:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 16:48:40,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:48:40,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,603 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,604 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,605 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:48:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:48:40,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:40,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:40,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 16:48:40,607 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 16:48:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,608 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:48:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:48:40,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:40,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:40,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:48:40,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:48:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 16:48:40,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 16:48:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:48:40,611 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 16:48:40,611 INFO L496 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-27 16:48:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:48:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:48:40,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:48:40,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:48:40,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:48:40,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:48:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:48:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1890769175, now seen corresponding path program 1 times [2022-04-27 16:48:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:48:40,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208899185] [2022-04-27 16:48:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:48:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:48:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:48:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {183#true} is VALID [2022-04-27 16:48:40,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:48:40,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:48:40,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:48:40,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {183#true} is VALID [2022-04-27 16:48:40,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:48:40,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:48:40,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#true} is VALID [2022-04-27 16:48:40,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {188#(= main_~x~0 0)} is VALID [2022-04-27 16:48:40,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {188#(= main_~x~0 0)} is VALID [2022-04-27 16:48:40,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= main_~x~0 0)} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {184#false} is VALID [2022-04-27 16:48:40,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {184#false} is VALID [2022-04-27 16:48:40,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:48:40,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {184#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {184#false} is VALID [2022-04-27 16:48:40,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {184#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {184#false} is VALID [2022-04-27 16:48:40,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:48:40,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#false} is VALID [2022-04-27 16:48:40,726 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-27 16:48:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:48:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208899185] [2022-04-27 16:48:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208899185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:48:40,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:48:40,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:48:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366698486] [2022-04-27 16:48:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:48:40,727 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-27 16:48:40,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:48:40,728 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-27 16:48:40,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:40,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:48:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:48:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:48:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:48:40,738 INFO L87 Difference]: Start difference. First operand 17 states and 19 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-27 16:48:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,774 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 16:48:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:48:40,774 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-27 16:48:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:48:40,775 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-27 16:48:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 16:48:40,776 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-27 16:48:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 16:48:40,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-27 16:48:40,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:40,791 INFO L225 Difference]: With dead ends: 20 [2022-04-27 16:48:40,792 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 16:48:40,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:48:40,792 INFO L413 NwaCegarLoop]: 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-27 16:48:40,793 INFO L414 NwaCegarLoop]: 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-27 16:48:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 16:48:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-27 16:48:40,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:48:40,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,795 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,795 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,796 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 16:48:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 16:48:40,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:40,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:40,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 20 states. [2022-04-27 16:48:40,796 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 20 states. [2022-04-27 16:48:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:40,797 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 16:48:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 16:48:40,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:40,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:40,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:48:40,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:48:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 16:48:40,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-27 16:48:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:48:40,799 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 16:48:40,799 INFO L496 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-27 16:48:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 16:48:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:48:40,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:48:40,800 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:48:40,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:48:40,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:48:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:48:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1862314917, now seen corresponding path program 1 times [2022-04-27 16:48:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:48:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293992754] [2022-04-27 16:48:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:48:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:48:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:48:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {273#true} is VALID [2022-04-27 16:48:40,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:40,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {273#true} {273#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:40,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:48:40,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {273#true} is VALID [2022-04-27 16:48:40,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:40,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:40,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:40,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {278#(= main_~x~0 0)} is VALID [2022-04-27 16:48:40,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {278#(= main_~x~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {278#(= main_~x~0 0)} is VALID [2022-04-27 16:48:40,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {278#(= main_~x~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {278#(= main_~x~0 0)} is VALID [2022-04-27 16:48:40,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {278#(= main_~x~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {279#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:48:40,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {279#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {279#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:48:40,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {279#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {274#false} is VALID [2022-04-27 16:48:40,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#false} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {274#false} is VALID [2022-04-27 16:48:40,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#false} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:40,870 INFO L272 TraceCheckUtils]: 13: Hoare triple {274#false} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {274#false} is VALID [2022-04-27 16:48:40,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#false} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {274#false} is VALID [2022-04-27 16:48:40,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {274#false} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:40,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:40,870 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-27 16:48:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:48:40,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293992754] [2022-04-27 16:48:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293992754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:48:40,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892862140] [2022-04-27 16:48:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:48:40,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:48:40,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:48:40,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:48:40,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:48:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:48:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:48:40,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:48:41,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {273#true} is VALID [2022-04-27 16:48:41,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {299#(= main_~z~0 0)} is VALID [2022-04-27 16:48:41,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(= main_~z~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {299#(= main_~z~0 0)} is VALID [2022-04-27 16:48:41,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#(= main_~z~0 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {299#(= main_~z~0 0)} is VALID [2022-04-27 16:48:41,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(= main_~z~0 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {299#(= main_~z~0 0)} is VALID [2022-04-27 16:48:41,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {299#(= main_~z~0 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {299#(= main_~z~0 0)} is VALID [2022-04-27 16:48:41,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {299#(= main_~z~0 0)} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {315#(= main_~z~0 2)} is VALID [2022-04-27 16:48:41,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#(= main_~z~0 2)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {315#(= main_~z~0 2)} is VALID [2022-04-27 16:48:41,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(= main_~z~0 2)} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {315#(= main_~z~0 2)} is VALID [2022-04-27 16:48:41,020 INFO L272 TraceCheckUtils]: 13: Hoare triple {315#(= main_~z~0 2)} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:48:41,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:48:41,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:41,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 16:48:41,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:48:41,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#false} [65] L4-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:41,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} [63] L4-->L4-1: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {274#false} is VALID [2022-04-27 16:48:41,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L4: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:48:41,137 INFO L272 TraceCheckUtils]: 13: Hoare triple {345#(= (mod main_~z~0 2) 0)} [56] L10-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (mod v_main_~z~0_5 2)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:48:41,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {345#(= (mod main_~z~0 2) 0)} [54] L10-2-->L10-3: Formula: (not (< (mod v_main_~x~0_7 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {345#(= (mod main_~z~0 2) 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#(= (mod main_~z~0 2) 0)} [57] L11-->L11-2: Formula: (and (<= 5000000 (mod v_main_~x~0_2 4294967296)) (= (+ v_main_~z~0_2 2) v_main_~z~0_1)) InVars {main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_~z~0] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#(= (mod main_~z~0 2) 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {345#(= (mod main_~z~0 2) 0)} [61] L11-2-->L10-2: Formula: (= v_main_~x~0_5 (+ v_main_~x~0_6 1)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_5, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(= (mod main_~z~0 2) 0)} [58] L11-->L11-2: Formula: (not (<= 5000000 (mod v_main_~x~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(= (mod main_~z~0 2) 0)} [55] L10-2-->L11: Formula: (< (mod v_main_~x~0_1 4294967296) (mod v_main_~y~0_1 4294967296)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} [51] mainENTRY-->L10-2: Formula: (and (= v_main_~y~0_2 10000000) (= v_main_~z~0_3 0) (= v_main_~x~0_4 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0] {345#(= (mod main_~z~0 2) 0)} is VALID [2022-04-27 16:48:41,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} [49] 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|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {273#true} is VALID [2022-04-27 16:48:41,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {273#true} is VALID [2022-04-27 16:48:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 16:48:41,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892862140] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 16:48:41,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 16:48:41,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2022-04-27 16:48:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770677962] [2022-04-27 16:48:41,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:48:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:48:41,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:48:41,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:41,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:41,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:48:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:48:41,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:48:41,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:48:41,154 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:41,183 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 16:48:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:48:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:48:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:48:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-27 16:48:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-04-27 16:48:41,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2022-04-27 16:48:41,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:48:41,194 INFO L225 Difference]: With dead ends: 17 [2022-04-27 16:48:41,194 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:48:41,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:48:41,195 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:48:41,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:48:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:48:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:48:41,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:48:41,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:48:41,196 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:48:41,196 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:48:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:41,197 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:48:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:48:41,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:41,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:41,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:48:41,197 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:48:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:48:41,197 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:48:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:48:41,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:41,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:48:41,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:48:41,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:48:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:48:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:48:41,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 16:48:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:48:41,198 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:48:41,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:48:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:48:41,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:48:41,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:48:41,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:48:41,405 WARN L477 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-27 16:48:41,408 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 16:48:41,409 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:48:41,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:48:41 BasicIcfg [2022-04-27 16:48:41,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:48:41,412 INFO L158 Benchmark]: Toolchain (without parser) took 2012.82ms. Allocated memory was 199.2MB in the beginning and 275.8MB in the end (delta: 76.5MB). Free memory was 146.8MB in the beginning and 178.1MB in the end (delta: -31.2MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2022-04-27 16:48:41,412 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory was 162.9MB in the beginning and 162.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:48:41,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.36ms. Allocated memory is still 199.2MB. Free memory was 146.7MB in the beginning and 171.1MB in the end (delta: -24.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-27 16:48:41,412 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 199.2MB. Free memory was 171.1MB in the beginning and 169.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:48:41,413 INFO L158 Benchmark]: RCFGBuilder took 246.93ms. Allocated memory is still 199.2MB. Free memory was 169.5MB in the beginning and 159.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 16:48:41,413 INFO L158 Benchmark]: IcfgTransformer took 17.15ms. Allocated memory is still 199.2MB. Free memory was 159.4MB in the beginning and 158.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:48:41,413 INFO L158 Benchmark]: TraceAbstraction took 1503.09ms. Allocated memory was 199.2MB in the beginning and 275.8MB in the end (delta: 76.5MB). Free memory was 157.6MB in the beginning and 178.1MB in the end (delta: -20.5MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. [2022-04-27 16:48:41,414 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.09ms. Allocated memory is still 199.2MB. Free memory was 162.9MB in the beginning and 162.8MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.36ms. Allocated memory is still 199.2MB. Free memory was 146.7MB in the beginning and 171.1MB in the end (delta: -24.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 199.2MB. Free memory was 171.1MB in the beginning and 169.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.93ms. Allocated memory is still 199.2MB. Free memory was 169.5MB in the beginning and 159.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 17.15ms. Allocated memory is still 199.2MB. Free memory was 159.4MB in the beginning and 158.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1503.09ms. Allocated memory was 199.2MB in the beginning and 275.8MB in the end (delta: 76.5MB). Free memory was 157.6MB in the beginning and 178.1MB in the end (delta: -20.5MB). Peak memory consumption was 57.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 58 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 203 SizeOfPredicates, 1 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 11/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:48:41,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...