/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:26:14,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:26:14,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:26:14,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:26:14,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:26:14,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:26:14,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:26:14,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:26:14,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:26:14,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:26:14,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:26:14,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:26:14,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:26:14,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:26:14,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:26:14,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:26:14,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:26:14,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:26:14,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:26:14,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:26:14,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:26:14,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:26:14,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:26:14,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:26:14,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:26:14,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:26:14,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:26:14,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:26:14,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:26:14,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:26:14,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:26:15,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:26:15,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:26:15,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:26:15,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:26:15,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:26:15,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:26:15,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:26:15,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:26:15,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:26:15,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:26:15,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:26:15,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:26:15,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:26:15,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:26:15,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:26:15,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:26:15,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:26:15,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:26:15,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:26:15,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:26:15,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:26:15,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:26:15,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:26:15,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:26:15,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:26:15,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:26:15,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:26:15,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:26:15,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:26:15,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:26:15,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:26:15,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:26:15,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:26:15,020 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:26:15,020 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:26:15,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:26:15,021 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:26:15,021 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 03:26:15,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:26:15,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:26:15,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:26:15,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:26:15,255 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:26:15,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-28 03:26:15,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c6a1f94/a087f79c6bf94df48f215554fb5b9d6c/FLAG059052de1 [2022-04-28 03:26:15,688 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:26:15,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-28 03:26:15,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c6a1f94/a087f79c6bf94df48f215554fb5b9d6c/FLAG059052de1 [2022-04-28 03:26:15,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c6a1f94/a087f79c6bf94df48f215554fb5b9d6c [2022-04-28 03:26:15,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:26:15,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:26:15,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:26:15,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:26:15,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:26:15,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca15312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15, skipping insertion in model container [2022-04-28 03:26:15,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:26:15,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:26:15,859 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-industry-pattern/mod3.c[394,407] [2022-04-28 03:26:15,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:26:15,878 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:26:15,888 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-industry-pattern/mod3.c[394,407] [2022-04-28 03:26:15,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:26:15,903 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:26:15,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15 WrapperNode [2022-04-28 03:26:15,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:26:15,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:26:15,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:26:15,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:26:15,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:26:15,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:26:15,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:26:15,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:26:15,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (1/1) ... [2022-04-28 03:26:15,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:26:15,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:26:15,966 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-28 03:26:15,968 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-28 03:26:15,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:26:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:26:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:26:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:26:15,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:26:15,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:26:15,999 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:26:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:26:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:26:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:26:16,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:26:16,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:26:16,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:26:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:26:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:26:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:26:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:26:16,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:26:16,047 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:26:16,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:26:20,481 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:26:20,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:26:20,489 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:26:20,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:26:20 BoogieIcfgContainer [2022-04-28 03:26:20,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:26:20,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:26:20,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:26:20,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:26:20,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:26:15" (1/3) ... [2022-04-28 03:26:20,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86f30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:26:20, skipping insertion in model container [2022-04-28 03:26:20,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:15" (2/3) ... [2022-04-28 03:26:20,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86f30f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:26:20, skipping insertion in model container [2022-04-28 03:26:20,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:26:20" (3/3) ... [2022-04-28 03:26:20,507 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c [2022-04-28 03:26:20,518 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:26:20,519 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:26:20,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:26:20,570 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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@15a3377c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15bf3ec9 [2022-04-28 03:26:20,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:26:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 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-28 03:26:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:26:20,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:20,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:20,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1060463359, now seen corresponding path program 1 times [2022-04-28 03:26:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [156073631] [2022-04-28 03:26:20,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:26:20,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1060463359, now seen corresponding path program 2 times [2022-04-28 03:26:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:26:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716000369] [2022-04-28 03:26:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:26:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:26:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:20,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 03:26:20,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:26:20,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-28 03:26:20,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:26:20,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 03:26:20,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:26:20,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-28 03:26:20,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2022-04-28 03:26:20,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {27#true} is VALID [2022-04-28 03:26:20,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 03:26:20,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume 0 == ~y~0 % 4294967296; {28#false} is VALID [2022-04-28 03:26:20,753 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 03:26:20,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 03:26:20,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:26:20,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:26:20,754 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-28 03:26:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:20,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716000369] [2022-04-28 03:26:20,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716000369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:20,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:20,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:26:20,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:26:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [156073631] [2022-04-28 03:26:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [156073631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:26:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998496089] [2022-04-28 03:26:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:26:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:26:20,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:26:20,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:20,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:20,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:26:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:26:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:26:20,807 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:29,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:26:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:29,561 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-28 03:26:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:26:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:26:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:26:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 03:26:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 03:26:29,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-28 03:26:29,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:29,639 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:26:29,639 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:26:29,641 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-28 03:26:29,644 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:26:29,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:26:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:26:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:26:29,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:26:29,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-28 03:26:29,669 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-28 03:26:29,669 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-28 03:26:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:29,671 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 03:26:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:26:29,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:29,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:29,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-28 03:26:29,673 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-28 03:26:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:29,675 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 03:26:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:26:29,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:29,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:29,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:26:29,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:26:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-28 03:26:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-28 03:26:29,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-28 03:26:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:26:29,679 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-28 03:26:29,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:26:29,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-28 03:26:29,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:26:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:26:29,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:29,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:29,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:26:29,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1839610256, now seen corresponding path program 1 times [2022-04-28 03:26:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:29,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [148305916] [2022-04-28 03:26:29,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:26:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1839610256, now seen corresponding path program 2 times [2022-04-28 03:26:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:26:29,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353297887] [2022-04-28 03:26:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:26:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:26:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:26:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:26:29,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-28 03:26:29,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-28 03:26:29,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #60#return; {179#true} is VALID [2022-04-28 03:26:29,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:26:29,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-28 03:26:29,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-28 03:26:29,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #60#return; {179#true} is VALID [2022-04-28 03:26:29,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret7 := main(); {179#true} is VALID [2022-04-28 03:26:29,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {184#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 03:26:29,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(= (+ (- 1) main_~y~0) 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {184#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 03:26:29,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(= (+ (- 1) main_~y~0) 0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {184#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-28 03:26:29,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#(= (+ (- 1) main_~y~0) 0)} assume 0 == ~y~0 % 4294967296; {180#false} is VALID [2022-04-28 03:26:29,846 INFO L272 TraceCheckUtils]: 9: Hoare triple {180#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {180#false} is VALID [2022-04-28 03:26:29,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {180#false} ~cond := #in~cond; {180#false} is VALID [2022-04-28 03:26:29,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {180#false} assume 0 == ~cond; {180#false} is VALID [2022-04-28 03:26:29,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-28 03:26:29,847 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-28 03:26:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:26:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353297887] [2022-04-28 03:26:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353297887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:29,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:29,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:26:29,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:26:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [148305916] [2022-04-28 03:26:29,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [148305916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:26:29,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:26:29,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:26:29,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307563369] [2022-04-28 03:26:29,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:26:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-28 03:26:29,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:26:29,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 03:26:29,884 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-28 03:26:29,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:26:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:26:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:26:29,886 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 03:26:34,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:26:38,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:26:42,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:26:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:43,005 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 03:26:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:26:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-28 03:26:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:26:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 03:26:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-28 03:26:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 03:26:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-28 03:26:43,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-28 03:26:43,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:43,052 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:26:43,052 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:26:43,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 03:26:43,053 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:26:43,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 03:26:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:26:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-28 03:26:43,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:26:43,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-28 03:26:43,063 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-28 03:26:43,064 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-28 03:26:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:43,071 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 03:26:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 03:26:43,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:43,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:43,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:26:43,072 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:26:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:26:43,074 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 03:26:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 03:26:43,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:26:43,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:26:43,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:26:43,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:26:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-28 03:26:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 03:26:43,076 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-04-28 03:26:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:26:43,076 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 03:26:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-28 03:26:43,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 03:26:43,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:26:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:26:43,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:26:43,108 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:26:43,108 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:26:43,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:26:43,109 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:26:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:26:43,111 INFO L85 PathProgramCache]: Analyzing trace with hash -496948910, now seen corresponding path program 1 times [2022-04-28 03:26:43,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:26:43,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075724911] [2022-04-28 03:27:24,964 WARN L232 SmtUtils]: Spent 41.47s on a formula simplification that was a NOOP. DAG size: 54 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 03:27:31,622 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:27:33,855 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-28 03:27:38,327 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 03:28:29,515 WARN L232 SmtUtils]: Spent 48.75s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 03:28:29,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:28:29,520 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 03:28:29,523 INFO L158 Benchmark]: Toolchain (without parser) took 133815.61ms. Allocated memory is still 184.5MB. Free memory was 138.4MB in the beginning and 97.6MB in the end (delta: 40.8MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2022-04-28 03:28:29,524 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory was 154.8MB in the beginning and 154.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:28:29,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.49ms. Allocated memory is still 184.5MB. Free memory was 138.3MB in the beginning and 165.0MB in the end (delta: -26.7MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-28 03:28:29,525 INFO L158 Benchmark]: Boogie Preprocessor took 28.54ms. Allocated memory is still 184.5MB. Free memory was 165.0MB in the beginning and 163.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:28:29,525 INFO L158 Benchmark]: RCFGBuilder took 4557.10ms. Allocated memory is still 184.5MB. Free memory was 163.3MB in the beginning and 152.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:28:29,526 INFO L158 Benchmark]: TraceAbstraction took 129030.83ms. Allocated memory is still 184.5MB. Free memory was 151.5MB in the beginning and 97.6MB in the end (delta: 53.8MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. [2022-04-28 03:28:29,528 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 184.5MB. Free memory was 154.8MB in the beginning and 154.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.49ms. Allocated memory is still 184.5MB. Free memory was 138.3MB in the beginning and 165.0MB in the end (delta: -26.7MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.54ms. Allocated memory is still 184.5MB. Free memory was 165.0MB in the beginning and 163.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4557.10ms. Allocated memory is still 184.5MB. Free memory was 163.3MB in the beginning and 152.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 129030.83ms. Allocated memory is still 184.5MB. Free memory was 151.5MB in the beginning and 97.6MB in the end (delta: 53.8MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 03:28:29,560 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...