/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/loops-crafted-1/in-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:08:31,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:08:31,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:08:31,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:08:31,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:08:31,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:08:31,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:08:31,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:08:31,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:08:31,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:08:31,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:08:31,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:08:31,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:08:31,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:08:31,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:08:31,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:08:31,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:08:31,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:08:31,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:08:31,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:08:31,888 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:08:31,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:08:31,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:08:31,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:08:31,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:08:31,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:08:31,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:08:31,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:08:31,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:08:31,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:08:31,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:08:31,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:08:31,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:08:31,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:08:31,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:08:31,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:08:31,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:08:31,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:08:31,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:08:31,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:08:31,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:08:31,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:08:31,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:08:31,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:08:31,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:08:31,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:08:31,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:08:31,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:08:31,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:08:31,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:08:31,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:08:31,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:08:31,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:08:31,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:08:31,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:08:31,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:08:31,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:08:31,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:08:31,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:08:31,912 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:08:31,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:08:31,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:08:31,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:08:31,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:08:31,913 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:08:31,913 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:08:31,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:08:31,914 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:08:31,914 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-08 04:08:32,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:08:32,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:08:32,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:08:32,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:08:32,159 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:08:32,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-08 04:08:32,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aa84e09/58af587676ee48b2b57ff6cf2c09c689/FLAG34d4e97f5 [2022-04-08 04:08:32,560 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:08:32,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-08 04:08:32,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aa84e09/58af587676ee48b2b57ff6cf2c09c689/FLAG34d4e97f5 [2022-04-08 04:08:32,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aa84e09/58af587676ee48b2b57ff6cf2c09c689 [2022-04-08 04:08:32,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:08:32,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:08:32,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:08:32,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:08:32,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:08:32,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:32" (1/1) ... [2022-04-08 04:08:32,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af7e222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:32, skipping insertion in model container [2022-04-08 04:08:32,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:32" (1/1) ... [2022-04-08 04:08:32,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:08:33,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:08:33,137 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-04-08 04:08:33,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:08:33,172 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:08:33,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-04-08 04:08:33,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:08:33,206 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:08:33,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33 WrapperNode [2022-04-08 04:08:33,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:08:33,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:08:33,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:08:33,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:08:33,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:08:33,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:08:33,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:08:33,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:08:33,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (1/1) ... [2022-04-08 04:08:33,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:08:33,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:08:33,280 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-08 04:08:33,304 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-08 04:08:33,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:08:33,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:08:33,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:08:33,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:08:33,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:08:33,326 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:08:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:08:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:08:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:08:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:08:33,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:08:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:08:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:08:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:08:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:08:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:08:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:08:33,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:08:33,386 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:08:33,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:08:33,571 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:08:33,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:08:33,576 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 04:08:33,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:33 BoogieIcfgContainer [2022-04-08 04:08:33,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:08:33,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:08:33,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:08:33,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:08:33,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:08:32" (1/3) ... [2022-04-08 04:08:33,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187614c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:33, skipping insertion in model container [2022-04-08 04:08:33,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:33" (2/3) ... [2022-04-08 04:08:33,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187614c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:33, skipping insertion in model container [2022-04-08 04:08:33,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:33" (3/3) ... [2022-04-08 04:08:33,583 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-08 04:08:33,587 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:08:33,587 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:08:33,621 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:08:33,626 INFO L340 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 [2022-04-08 04:08:33,626 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:08:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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-08 04:08:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:08:33,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:33,648 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:33,649 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:33,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-08 04:08:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:33,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292509493] [2022-04-08 04:08:33,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:08:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-08 04:08:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:33,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848430436] [2022-04-08 04:08:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:33,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-08 04:08:33,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 04:08:33,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 04:08:33,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:33,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-08 04:08:33,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 04:08:33,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 04:08:33,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-08 04:08:33,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25#true} is VALID [2022-04-08 04:08:33,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !(~x~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 04:08:33,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 04:08:33,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 04:08:33,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-08 04:08:34,000 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:08:34,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:08:34,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-08 04:08:34,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 04:08:34,003 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-08 04:08:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:34,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848430436] [2022-04-08 04:08:34,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848430436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:34,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:34,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:08:34,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:34,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292509493] [2022-04-08 04:08:34,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292509493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:34,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:08:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733280888] [2022-04-08 04:08:34,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:34,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:08:34,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:34,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:34,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:08:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:34,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:08:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:08:34,068 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:34,434 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-08 04:08:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:08:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:08:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-08 04:08:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-08 04:08:34,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-08 04:08:34,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:34,539 INFO L225 Difference]: With dead ends: 47 [2022-04-08 04:08:34,539 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 04:08:34,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:08:34,545 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:34,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:08:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 04:08:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 04:08:34,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:34,579 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-08 04:08:34,580 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-08 04:08:34,581 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-08 04:08:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:34,584 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 04:08:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 04:08:34,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:34,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:34,585 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-08 04:08:34,586 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-08 04:08:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:34,587 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 04:08:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 04:08:34,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:34,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:34,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:34,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:34,589 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-08 04:08:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-08 04:08:34,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-08 04:08:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:34,591 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-08 04:08:34,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-08 04:08:34,625 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-08 04:08:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 04:08:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:08:34,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:34,631 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:34,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:08:34,632 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-08 04:08:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:34,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529482059] [2022-04-08 04:08:34,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:08:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 2 times [2022-04-08 04:08:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:34,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838558872] [2022-04-08 04:08:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:34,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:34,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(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(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-08 04:08:34,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-08 04:08:34,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-08 04:08:34,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:34,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(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(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-08 04:08:34,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-08 04:08:34,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-08 04:08:34,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret11 := main(); {206#true} is VALID [2022-04-08 04:08:34,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {211#(= main_~y~0 0)} is VALID [2022-04-08 04:08:34,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-08 04:08:34,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~y~0 0)} ~z~0 := ~y~0; {211#(= main_~y~0 0)} is VALID [2022-04-08 04:08:34,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-08 04:08:34,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {207#false} is VALID [2022-04-08 04:08:34,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} assume !(~y~0 % 4294967296 > 0); {207#false} is VALID [2022-04-08 04:08:34,704 INFO L272 TraceCheckUtils]: 11: Hoare triple {207#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {207#false} is VALID [2022-04-08 04:08:34,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2022-04-08 04:08:34,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2022-04-08 04:08:34,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-04-08 04:08:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:08:34,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:34,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838558872] [2022-04-08 04:08:34,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838558872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:34,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:34,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:08:34,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:34,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529482059] [2022-04-08 04:08:34,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529482059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:34,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:34,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:08:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499803576] [2022-04-08 04:08:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:34,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-08 04:08:34,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:34,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 04:08:34,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:34,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:08:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:08:34,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:08:34,725 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 04:08:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:34,780 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-08 04:08:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:08:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-08 04:08:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 04:08:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 04:08:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 04:08:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-08 04:08:34,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-08 04:08:34,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:34,812 INFO L225 Difference]: With dead ends: 30 [2022-04-08 04:08:34,812 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:08:34,812 INFO L912 BasicCegarLoop]: 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-08 04:08:34,813 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:34,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:08:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:08:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-08 04:08:34,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:34,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,820 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,821 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:34,822 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 04:08:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 04:08:34,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:34,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:34,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 04:08:34,823 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 04:08:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:34,824 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 04:08:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 04:08:34,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:34,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:34,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:34,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-08 04:08:34,826 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-08 04:08:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:34,827 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-08 04:08:34,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-08 04:08:34,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-08 04:08:34,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 04:08:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:08:34,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:34,859 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:34,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:08:34,859 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-08 04:08:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487168550] [2022-04-08 04:08:35,242 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:08:35,245 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 04:08:35,248 INFO L158 Benchmark]: Toolchain (without parser) took 2266.70ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 106.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-08 04:08:35,248 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory was 137.2MB in the beginning and 137.1MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:08:35,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.46ms. Allocated memory is still 169.9MB. Free memory was 120.0MB in the beginning and 147.4MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:08:35,249 INFO L158 Benchmark]: Boogie Preprocessor took 42.23ms. Allocated memory is still 169.9MB. Free memory was 147.4MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:08:35,250 INFO L158 Benchmark]: RCFGBuilder took 326.95ms. Allocated memory is still 169.9MB. Free memory was 145.7MB in the beginning and 134.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:08:35,250 INFO L158 Benchmark]: TraceAbstraction took 1668.33ms. Allocated memory is still 169.9MB. Free memory was 133.8MB in the beginning and 106.2MB in the end (delta: 27.6MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2022-04-08 04:08:35,251 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 169.9MB. Free memory was 137.2MB in the beginning and 137.1MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.46ms. Allocated memory is still 169.9MB. Free memory was 120.0MB in the beginning and 147.4MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.23ms. Allocated memory is still 169.9MB. Free memory was 147.4MB in the beginning and 145.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 326.95ms. Allocated memory is still 169.9MB. Free memory was 145.7MB in the beginning and 134.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1668.33ms. Allocated memory is still 169.9MB. Free memory was 133.8MB in the beginning and 106.2MB in the end (delta: 27.6MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:08:35,280 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...