/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/loop-invariants/eq1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:01:53,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:01:53,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:01:53,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:01:53,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:01:53,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:01:53,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:01:53,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:01:53,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:01:53,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:01:53,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:01:53,915 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:01:53,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:01:53,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:01:53,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:01:53,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:01:53,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:01:53,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:01:53,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:01:53,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:01:53,923 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:01:53,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:01:53,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:01:53,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:01:53,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:01:53,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:01:53,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:01:53,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:01:53,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:01:53,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:01:53,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:01:53,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:01:53,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:01:53,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:01:53,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:01:53,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:01:53,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:01:53,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:01:53,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:01:53,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:01:53,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:01:53,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:01:53,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:01:53,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:01:53,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:01:53,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:01:53,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:01:53,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:01:53,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:01:53,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:01:53,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:01:53,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:01:53,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:01:53,953 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:01:53,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:01:53,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:01:53,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:01:53,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:01:53,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:01:53,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:01:53,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:01:53,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:01:53,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:01:53,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:01:53,955 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:01:53,955 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 20:01:54,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:01:54,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:01:54,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:01:54,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:01:54,186 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:01:54,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/eq1.c [2022-04-14 20:01:54,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f01298bf/bbb659cdd1f2463b9b47bab8bdbfac0e/FLAGedf24fc71 [2022-04-14 20:01:54,606 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:01:54,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq1.c [2022-04-14 20:01:54,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f01298bf/bbb659cdd1f2463b9b47bab8bdbfac0e/FLAGedf24fc71 [2022-04-14 20:01:54,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f01298bf/bbb659cdd1f2463b9b47bab8bdbfac0e [2022-04-14 20:01:54,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:01:54,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:01:54,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:01:54,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:01:54,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:01:54,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4068d20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54, skipping insertion in model container [2022-04-14 20:01:54,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:01:54,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:01:54,782 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq1.c[364,377] [2022-04-14 20:01:54,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:01:54,821 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:01:54,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/eq1.c[364,377] [2022-04-14 20:01:54,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:01:54,845 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:01:54,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54 WrapperNode [2022-04-14 20:01:54,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:01:54,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:01:54,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:01:54,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:01:54,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:01:54,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:01:54,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:01:54,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:01:54,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (1/1) ... [2022-04-14 20:01:54,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:01:54,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:01:54,898 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 20:01:54,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 20:01:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:01:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:01:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:01:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:01:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:01:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 20:01:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:01:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:01:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:01:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:01:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:01:54,984 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:01:54,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:01:55,063 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:01:55,069 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:01:55,069 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:01:55,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:01:55 BoogieIcfgContainer [2022-04-14 20:01:55,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:01:55,071 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:01:55,071 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:01:55,080 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:01:55,083 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:01:55" (1/1) ... [2022-04-14 20:01:55,085 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:01:55,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:01:55 BasicIcfg [2022-04-14 20:01:55,100 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:01:55,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:01:55,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:01:55,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:01:55,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:01:54" (1/4) ... [2022-04-14 20:01:55,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5209e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:01:55, skipping insertion in model container [2022-04-14 20:01:55,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:01:54" (2/4) ... [2022-04-14 20:01:55,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5209e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:01:55, skipping insertion in model container [2022-04-14 20:01:55,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:01:55" (3/4) ... [2022-04-14 20:01:55,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5209e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:01:55, skipping insertion in model container [2022-04-14 20:01:55,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:01:55" (4/4) ... [2022-04-14 20:01:55,107 INFO L111 eAbstractionObserver]: Analyzing ICFG eq1.cJordan [2022-04-14 20:01:55,111 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:01:55,111 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:01:55,143 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:01:55,149 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 20:01:55,149 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:01:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 20:01:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 20:01:55,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:01:55,174 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:01:55,174 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:01:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:01:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-04-14 20:01:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:01:55,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197627860] [2022-04-14 20:01:55,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:01:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:01:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:01:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:55,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 2)) (.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= 49 (select .cse1 2)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 20:01:55,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:01:55,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:01:55,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:01:55,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 2)) (.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= 49 (select .cse1 2)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-14 20:01:55,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:01:55,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:01:55,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-14 20:01:55,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [50] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_3) (= v_main_~w~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_3 |v_main_#t~nondet5_2|) (= v_main_~w~0_1 v_main_~x~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_3, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {23#true} is VALID [2022-04-14 20:01:55,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [52] L17-2-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:01:55,372 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [55] L16-2-->__VERIFIER_assertENTRY: Formula: (= (ite (and (= (mod v_main_~y~0_5 4294967296) (mod v_main_~z~0_5 4294967296)) (= (mod v_main_~w~0_5 4294967296) (mod v_main_~x~0_5 4294967296))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~w~0=v_main_~w~0_5, main_~x~0=v_main_~x~0_5, 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_~w~0, main_~x~0, main_~z~0, main_~y~0] {24#false} is VALID [2022-04-14 20:01:55,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [59] __VERIFIER_assertENTRY-->L6: 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] {24#false} is VALID [2022-04-14 20:01:55,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [61] L6-->L7: 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[] {24#false} is VALID [2022-04-14 20:01:55,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-14 20:01:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:01:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:01:55,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197627860] [2022-04-14 20:01:55,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197627860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:01:55,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:01:55,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:01:55,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918042424] [2022-04-14 20:01:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:01:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:01:55,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:01:55,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:01:55,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:01:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:01:55,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:01:55,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:01:55,434 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:55,517 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-14 20:01:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:01:55,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:01:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:01:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:01:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-14 20:01:55,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-14 20:01:55,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:01:55,614 INFO L225 Difference]: With dead ends: 20 [2022-04-14 20:01:55,614 INFO L226 Difference]: Without dead ends: 13 [2022-04-14 20:01:55,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:01:55,622 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:01:55,623 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:01:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-14 20:01:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-14 20:01:55,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:01:55,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,650 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,650 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:55,655 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-14 20:01:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-14 20:01:55,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:55,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:55,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-14 20:01:55,657 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-14 20:01:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:55,664 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-14 20:01:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-14 20:01:55,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:55,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:55,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:01:55,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:01:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-14 20:01:55,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-14 20:01:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:01:55,668 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-14 20:01:55,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-14 20:01:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-14 20:01:55,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:01:55,671 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:01:55,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:01:55,672 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:01:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:01:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-04-14 20:01:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:01:55,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458230570] [2022-04-14 20:01:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:01:55,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:01:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:01:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:55,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 2)) (.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= 49 (select .cse1 2)) (= (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] {90#true} is VALID [2022-04-14 20:01:55,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:01:55,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:01:55,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [46] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:01:55,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [48] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 2)) (.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 6) (= (select .cse1 3) 46) (= (select .cse1 4) 99) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 (select .cse1 5)) (= (select .cse1 1) 113) (= (select |v_#length_1| 3) 12) (= 101 (select .cse1 0)) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= 49 (select .cse1 2)) (= (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] {90#true} is VALID [2022-04-14 20:01:55,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [51] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:01:55,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:01:55,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [47] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-14 20:01:55,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [50] mainENTRY-->L17-2: Formula: (and (= v_main_~y~0_3 v_main_~z~0_3) (= v_main_~w~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_3 |v_main_#t~nondet5_2|) (= v_main_~w~0_1 v_main_~x~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_3, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {95#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} is VALID [2022-04-14 20:01:55,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} [53] L17-2-->L16-2: Formula: (= (mod |v_main_#t~nondet6_2| 4294967296) 0) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet6] {95#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} is VALID [2022-04-14 20:01:55,924 INFO L272 TraceCheckUtils]: 7: Hoare triple {95#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= 0 (+ main_~w~0 (* (- 1) main_~x~0))))} [55] L16-2-->__VERIFIER_assertENTRY: Formula: (= (ite (and (= (mod v_main_~y~0_5 4294967296) (mod v_main_~z~0_5 4294967296)) (= (mod v_main_~w~0_5 4294967296) (mod v_main_~x~0_5 4294967296))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5, main_~w~0=v_main_~w~0_5, main_~x~0=v_main_~x~0_5, 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_~w~0, main_~x~0, main_~z~0, main_~y~0] {96#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:01:55,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#(not (= |__VERIFIER_assert_#in~cond| 0))} [59] __VERIFIER_assertENTRY-->L6: 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] {97#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:01:55,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {97#(not (= __VERIFIER_assert_~cond 0))} [61] L6-->L7: 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[] {91#false} is VALID [2022-04-14 20:01:55,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#false} [63] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-14 20:01:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:01:55,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:01:55,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458230570] [2022-04-14 20:01:55,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458230570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:01:55,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:01:55,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 20:01:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358745936] [2022-04-14 20:01:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:01:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:01:55,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:01:55,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:55,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:01:55,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:01:55,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:01:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:01:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:01:55,950 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:56,078 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-04-14 20:01:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:01:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-14 20:01:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:01:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-14 20:01:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-14 20:01:56,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-14 20:01:56,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:01:56,103 INFO L225 Difference]: With dead ends: 11 [2022-04-14 20:01:56,104 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:01:56,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:01:56,109 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:01:56,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:01:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:01:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:01:56,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:01:56,114 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-14 20:01:56,114 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-14 20:01:56,114 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-14 20:01:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:56,115 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:01:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:01:56,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:56,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:56,115 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-14 20:01:56,115 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-14 20:01:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:56,116 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:01:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:01:56,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:56,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:56,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:01:56,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:01:56,127 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-14 20:01:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:01:56,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-14 20:01:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:01:56,128 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:01:56,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 20:01:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:01:56,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:56,130 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:01:56,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:01:56,133 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-14 20:01:56,134 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:01:56,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:01:56 BasicIcfg [2022-04-14 20:01:56,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:01:56,157 INFO L158 Benchmark]: Toolchain (without parser) took 1533.62ms. Allocated memory was 183.5MB in the beginning and 262.1MB in the end (delta: 78.6MB). Free memory was 127.2MB in the beginning and 233.1MB in the end (delta: -105.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:01:56,158 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:01:56,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.29ms. Allocated memory was 183.5MB in the beginning and 262.1MB in the end (delta: 78.6MB). Free memory was 127.0MB in the beginning and 233.1MB in the end (delta: -106.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-14 20:01:56,158 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 262.1MB. Free memory was 233.1MB in the beginning and 231.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:01:56,162 INFO L158 Benchmark]: RCFGBuilder took 199.41ms. Allocated memory is still 262.1MB. Free memory was 231.7MB in the beginning and 221.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 20:01:56,162 INFO L158 Benchmark]: IcfgTransformer took 28.52ms. Allocated memory is still 262.1MB. Free memory was 221.2MB in the beginning and 220.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:01:56,162 INFO L158 Benchmark]: TraceAbstraction took 1054.90ms. Allocated memory is still 262.1MB. Free memory was 219.5MB in the beginning and 233.1MB in the end (delta: -13.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:01:56,164 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.12ms. Allocated memory is still 183.5MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.29ms. Allocated memory was 183.5MB in the beginning and 262.1MB in the end (delta: 78.6MB). Free memory was 127.0MB in the beginning and 233.1MB in the end (delta: -106.2MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 262.1MB. Free memory was 233.1MB in the beginning and 231.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 199.41ms. Allocated memory is still 262.1MB. Free memory was 231.7MB in the beginning and 221.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 28.52ms. Allocated memory is still 262.1MB. Free memory was 221.2MB in the beginning and 220.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1054.90ms. Allocated memory is still 262.1MB. Free memory was 219.5MB in the beginning and 233.1MB in the end (delta: -13.6MB). There was no memory consumed. 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: 7]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 29 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 20:01:56,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...