/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/nla-digbench-scaling/geo1-u_unwindbound100.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 09:09:19,995 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 09:09:19,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 09:09:20,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 09:09:20,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 09:09:20,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 09:09:20,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 09:09:20,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 09:09:20,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 09:09:20,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 09:09:20,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 09:09:20,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 09:09:20,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 09:09:20,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 09:09:20,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 09:09:20,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 09:09:20,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 09:09:20,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 09:09:20,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 09:09:20,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 09:09:20,053 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 09:09:20,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 09:09:20,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 09:09:20,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 09:09:20,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 09:09:20,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 09:09:20,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 09:09:20,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 09:09:20,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 09:09:20,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 09:09:20,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 09:09:20,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 09:09:20,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 09:09:20,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 09:09:20,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 09:09:20,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 09:09:20,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 09:09:20,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 09:09:20,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 09:09:20,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 09:09:20,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 09:09:20,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 09:09:20,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 09:09:20,076 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 09:09:20,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 09:09:20,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 09:09:20,077 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 09:09:20,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 09:09:20,077 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 09:09:20,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 09:09:20,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 09:09:20,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 09:09:20,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 09:09:20,078 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 09:09:20,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 09:09:20,078 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 09:09:20,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 09:09:20,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 09:09:20,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 09:09:20,079 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 09:09:20,079 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-15 09:09:20,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 09:09:20,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 09:09:20,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 09:09:20,282 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 09:09:20,283 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 09:09:20,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c
[2022-04-15 09:09:20,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0967dbb51/f0d42237f63745e5802b082a11ff1c4c/FLAG893b34731
[2022-04-15 09:09:20,682 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 09:09:20,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c
[2022-04-15 09:09:20,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0967dbb51/f0d42237f63745e5802b082a11ff1c4c/FLAG893b34731
[2022-04-15 09:09:20,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0967dbb51/f0d42237f63745e5802b082a11ff1c4c
[2022-04-15 09:09:20,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 09:09:20,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 09:09:20,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 09:09:20,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 09:09:20,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 09:09:20,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d6dc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20, skipping insertion in model container
[2022-04-15 09:09:20,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 09:09:20,713 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 09:09:20,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c[555,568]
[2022-04-15 09:09:20,865 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 09:09:20,870 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 09:09:20,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound100.c[555,568]
[2022-04-15 09:09:20,893 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 09:09:20,906 INFO L208 MainTranslator]: Completed translation
[2022-04-15 09:09:20,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20 WrapperNode
[2022-04-15 09:09:20,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 09:09:20,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 09:09:20,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 09:09:20,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 09:09:20,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 09:09:20,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 09:09:20,934 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 09:09:20,934 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 09:09:20,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (1/1) ...
[2022-04-15 09:09:20,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 09:09:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 09:09:21,003 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-15 09:09:21,024 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-15 09:09:21,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 09:09:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 09:09:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 09:09:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 09:09:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 09:09:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 09:09:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 09:09:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 09:09:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 09:09:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 09:09:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 09:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 09:09:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 09:09:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 09:09:21,132 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 09:09:21,135 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 09:09:21,325 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 09:09:21,329 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 09:09:21,329 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 09:09:21,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:09:21 BoogieIcfgContainer
[2022-04-15 09:09:21,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 09:09:21,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 09:09:21,360 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 09:09:21,362 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 09:09:21,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:09:20" (1/3) ...
[2022-04-15 09:09:21,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc81435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:09:21, skipping insertion in model container
[2022-04-15 09:09:21,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:20" (2/3) ...
[2022-04-15 09:09:21,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc81435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:09:21, skipping insertion in model container
[2022-04-15 09:09:21,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:09:21" (3/3) ...
[2022-04-15 09:09:21,364 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound100.c
[2022-04-15 09:09:21,367 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 09:09:21,367 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 09:09:21,447 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 09:09:21,456 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-15 09:09:21,456 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 09:09:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2022-04-15 09:09:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 09:09:21,487 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 09:09:21,488 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 09:09:21,488 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 09:09:21,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 09:09:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 1 times
[2022-04-15 09:09:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:21,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608836814]
[2022-04-15 09:09:21,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 09:09:21,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 2 times
[2022-04-15 09:09:21,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 09:09:21,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535411417]
[2022-04-15 09:09:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 09:09:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 09:09:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 09:09:21,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 09:09:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 09:09:21,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID
[2022-04-15 09:09:21,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-15 09:09:21,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID
[2022-04-15 09:09:21,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 09:09:21,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID
[2022-04-15 09:09:21,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-15 09:09:21,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID
[2022-04-15 09:09:21,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret7 := main(); {26#true} is VALID
[2022-04-15 09:09:21,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {26#true} is VALID
[2022-04-15 09:09:21,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID
[2022-04-15 09:09:21,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {27#false} is VALID
[2022-04-15 09:09:21,673 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {27#false} is VALID
[2022-04-15 09:09:21,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID
[2022-04-15 09:09:21,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID
[2022-04-15 09:09:21,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID
[2022-04-15 09:09:21,674 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-15 09:09:21,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 09:09:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535411417]
[2022-04-15 09:09:21,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535411417] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 09:09:21,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 09:09:21,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 09:09:21,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 09:09:21,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608836814]
[2022-04-15 09:09:21,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608836814] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 09:09:21,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 09:09:21,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 09:09:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796465750]
[2022-04-15 09:09:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 09:09:21,683 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-15 09:09:21,684 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 09:09:21,686 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-15 09:09:21,704 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-15 09:09:21,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 09:09:21,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:21,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 09:09:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 09:09:21,726 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-15 09:09:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:21,828 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions.
[2022-04-15 09:09:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 09:09:21,829 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-15 09:09:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 09:09:21,830 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-15 09:09:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions.
[2022-04-15 09:09:21,835 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-15 09:09:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions.
[2022-04-15 09:09:21,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions.
[2022-04-15 09:09:21,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 09:09:21,902 INFO L225 Difference]: With dead ends: 41
[2022-04-15 09:09:21,902 INFO L226 Difference]: Without dead ends: 19
[2022-04-15 09:09:21,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 09:09:21,906 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 09:09:21,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 09:09:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2022-04-15 09:09:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18.
[2022-04-15 09:09:21,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 09:09:21,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 09:09:21,926 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 09:09:21,926 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 09:09:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:21,928 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-15 09:09:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-15 09:09:21,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 09:09:21,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 09:09:21,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states.
[2022-04-15 09:09:21,929 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states.
[2022-04-15 09:09:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:21,930 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions.
[2022-04-15 09:09:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions.
[2022-04-15 09:09:21,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 09:09:21,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 09:09:21,931 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 09:09:21,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 09:09:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 09:09:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions.
[2022-04-15 09:09:21,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12
[2022-04-15 09:09:21,933 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 09:09:21,933 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions.
[2022-04-15 09:09:21,933 INFO L479 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-15 09:09:21,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions.
[2022-04-15 09:09:21,950 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-15 09:09:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions.
[2022-04-15 09:09:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 09:09:21,950 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 09:09:21,950 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 09:09:21,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 09:09:21,951 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 09:09:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 09:09:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 1 times
[2022-04-15 09:09:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511896266]
[2022-04-15 09:09:21,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 09:09:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 2 times
[2022-04-15 09:09:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 09:09:21,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918226860]
[2022-04-15 09:09:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 09:09:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 09:09:21,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 09:09:21,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853235733]
[2022-04-15 09:09:21,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 09:09:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 09:09:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 09:09:21,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 09:09:22,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-15 09:09:22,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 09:09:22,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 09:09:22,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 09:09:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 09:09:22,035 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 09:09:22,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID
[2022-04-15 09:09:22,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} #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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {190#true} is VALID
[2022-04-15 09:09:22,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID
[2022-04-15 09:09:22,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #55#return; {190#true} is VALID
[2022-04-15 09:09:22,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret7 := main(); {190#true} is VALID
[2022-04-15 09:09:22,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID
[2022-04-15 09:09:22,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID
[2022-04-15 09:09:22,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID
[2022-04-15 09:09:22,162 INFO L272 TraceCheckUtils]: 8: Hoare triple {210#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 09:09:22,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 09:09:22,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {191#false} is VALID
[2022-04-15 09:09:22,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID
[2022-04-15 09:09:22,164 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-15 09:09:22,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 09:09:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 09:09:22,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918226860]
[2022-04-15 09:09:22,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 09:09:22,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853235733]
[2022-04-15 09:09:22,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853235733] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 09:09:22,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 09:09:22,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 09:09:22,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 09:09:22,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1511896266]
[2022-04-15 09:09:22,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1511896266] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 09:09:22,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 09:09:22,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 09:09:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882441817]
[2022-04-15 09:09:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 09:09:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-15 09:09:22,167 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 09:09:22,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 09:09:22,176 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-15 09:09:22,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 09:09:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:22,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 09:09:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 09:09:22,178 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 09:09:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:22,270 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions.
[2022-04-15 09:09:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 09:09:22,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2022-04-15 09:09:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 09:09:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 09:09:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions.
[2022-04-15 09:09:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 09:09:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions.
[2022-04-15 09:09:22,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions.
[2022-04-15 09:09:22,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 09:09:22,303 INFO L225 Difference]: With dead ends: 29
[2022-04-15 09:09:22,303 INFO L226 Difference]: Without dead ends: 27
[2022-04-15 09:09:22,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-15 09:09:22,304 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 09:09:22,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 09:09:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-15 09:09:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25.
[2022-04-15 09:09:22,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 09:09:22,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,312 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,313 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:22,314 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-15 09:09:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-15 09:09:22,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 09:09:22,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 09:09:22,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states.
[2022-04-15 09:09:22,315 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states.
[2022-04-15 09:09:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:22,316 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions.
[2022-04-15 09:09:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2022-04-15 09:09:22,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 09:09:22,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 09:09:22,317 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 09:09:22,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 09:09:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions.
[2022-04-15 09:09:22,319 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 12
[2022-04-15 09:09:22,319 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 09:09:22,319 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions.
[2022-04-15 09:09:22,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 09:09:22,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions.
[2022-04-15 09:09:22,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 09:09:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions.
[2022-04-15 09:09:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2022-04-15 09:09:22,342 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 09:09:22,342 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 09:09:22,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-04-15 09:09:22,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 09:09:22,572 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 09:09:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 09:09:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 1 times
[2022-04-15 09:09:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:22,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037490115]
[2022-04-15 09:09:22,574 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 09:09:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 2 times
[2022-04-15 09:09:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 09:09:22,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298190524]
[2022-04-15 09:09:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 09:09:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 09:09:22,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 09:09:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596569588]
[2022-04-15 09:09:22,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 09:09:22,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 09:09:22,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 09:09:22,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 09:09:22,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-15 09:09:22,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 09:09:22,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 09:09:22,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 09:09:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 09:09:22,634 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 09:09:22,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {394#true} is VALID
[2022-04-15 09:09:22,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#true} #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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {402#(<= ~counter~0 0)} is VALID
[2022-04-15 09:09:22,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(<= ~counter~0 0)} assume true; {402#(<= ~counter~0 0)} is VALID
[2022-04-15 09:09:22,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#(<= ~counter~0 0)} {394#true} #55#return; {402#(<= ~counter~0 0)} is VALID
[2022-04-15 09:09:22,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {402#(<= ~counter~0 0)} call #t~ret7 := main(); {402#(<= ~counter~0 0)} is VALID
[2022-04-15 09:09:22,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {402#(<= ~counter~0 0)} is VALID
[2022-04-15 09:09:22,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {418#(<= |main_#t~post6| 0)} is VALID
[2022-04-15 09:09:22,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {395#false} is VALID
[2022-04-15 09:09:22,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {395#false} is VALID
[2022-04-15 09:09:22,735 INFO L272 TraceCheckUtils]: 9: Hoare triple {395#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {395#false} is VALID
[2022-04-15 09:09:22,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#false} ~cond := #in~cond; {395#false} is VALID
[2022-04-15 09:09:22,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {395#false} assume 0 == ~cond; {395#false} is VALID
[2022-04-15 09:09:22,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {395#false} assume !false; {395#false} is VALID
[2022-04-15 09:09:22,735 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-15 09:09:22,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 09:09:22,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 09:09:22,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298190524]
[2022-04-15 09:09:22,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 09:09:22,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596569588]
[2022-04-15 09:09:22,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596569588] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 09:09:22,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 09:09:22,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 09:09:22,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 09:09:22,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037490115]
[2022-04-15 09:09:22,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037490115] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 09:09:22,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 09:09:22,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 09:09:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094776305]
[2022-04-15 09:09:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 09:09:22,738 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), 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) Word has length 13
[2022-04-15 09:09:22,738 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 09:09:22,739 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), 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-15 09:09:22,748 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-15 09:09:22,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 09:09:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 09:09:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 09:09:22,751 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 09:09:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:22,793 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions.
[2022-04-15 09:09:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-15 09:09:22,793 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), 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) Word has length 13
[2022-04-15 09:09:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 09:09:22,794 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), 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-15 09:09:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions.
[2022-04-15 09:09:22,795 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), 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-15 09:09:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions.
[2022-04-15 09:09:22,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions.
[2022-04-15 09:09:22,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 09:09:22,817 INFO L225 Difference]: With dead ends: 33
[2022-04-15 09:09:22,817 INFO L226 Difference]: Without dead ends: 25
[2022-04-15 09:09:22,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 09:09:22,818 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 09:09:22,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 09:09:22,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2022-04-15 09:09:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25.
[2022-04-15 09:09:22,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 09:09:22,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,828 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,828 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:22,830 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions.
[2022-04-15 09:09:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-15 09:09:22,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 09:09:22,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 09:09:22,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states.
[2022-04-15 09:09:22,830 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states.
[2022-04-15 09:09:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 09:09:22,831 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions.
[2022-04-15 09:09:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-15 09:09:22,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 09:09:22,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 09:09:22,832 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 09:09:22,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 09:09:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-15 09:09:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions.
[2022-04-15 09:09:22,833 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13
[2022-04-15 09:09:22,833 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 09:09:22,833 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions.
[2022-04-15 09:09:22,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-15 09:09:22,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions.
[2022-04-15 09:09:22,856 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-15 09:09:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2022-04-15 09:09:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2022-04-15 09:09:22,857 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 09:09:22,857 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 09:09:22,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-15 09:09:23,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-15 09:09:23,067 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 09:09:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 09:09:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 1 times
[2022-04-15 09:09:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 09:09:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579790572]
[2022-04-15 09:09:23,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 09:09:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 2 times
[2022-04-15 09:09:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 09:09:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121464584]
[2022-04-15 09:09:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 09:09:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 09:09:23,088 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 09:09:23,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004402586]
[2022-04-15 09:09:23,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 09:09:23,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 09:09:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 09:09:23,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 09:09:23,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2022-04-15 09:09:23,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 09:09:23,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2022-04-15 09:09:23,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-15 09:09:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-15 09:09:23,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-15 09:09:23,143 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-15 09:09:23,143 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-15 09:09:23,145 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-15 09:09:23,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2022-04-15 09:09:23,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 09:09:23,362 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2]
[2022-04-15 09:09:23,364 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-15 09:09:23,377 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation
[2022-04-15 09:09:23,378 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation
[2022-04-15 09:09:23,379 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation
[2022-04-15 09:09:23,380 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation
[2022-04-15 09:09:23,380 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 09:09:23,391 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-15 09:09:23,392 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation
[2022-04-15 09:09:23,392 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-15 09:09:23,392 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-15 09:09:23,392 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-15 09:09:23,392 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-15 09:09:23,392 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-15 09:09:23,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 09:09:23 BoogieIcfgContainer
[2022-04-15 09:09:23,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-15 09:09:23,394 INFO L158 Benchmark]: Toolchain (without parser) took 2697.23ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 140.9MB in the beginning and 116.4MB in the end (delta: 24.4MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB.
[2022-04-15 09:09:23,394 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 09:09:23,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.82ms. Allocated memory is still 167.8MB. Free memory was 140.9MB in the beginning and 139.2MB in the end (delta: 1.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB.
[2022-04-15 09:09:23,395 INFO L158 Benchmark]: Boogie Preprocessor took 26.31ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 137.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-15 09:09:23,395 INFO L158 Benchmark]: RCFGBuilder took 395.94ms. Allocated memory is still 167.8MB. Free memory was 137.7MB in the beginning and 127.0MB in the end (delta: 10.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 09:09:23,395 INFO L158 Benchmark]: TraceAbstraction took 2033.57ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 126.5MB in the beginning and 116.4MB in the end (delta: 10.0MB). Peak memory consumption was 45.9MB. Max. memory is 8.0GB.
[2022-04-15 09:09:23,396 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 167.8MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 209.82ms. Allocated memory is still 167.8MB. Free memory was 140.9MB in the beginning and 139.2MB in the end (delta: 1.7MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 26.31ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 137.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 395.94ms. Allocated memory is still 167.8MB. Free memory was 137.7MB in the beginning and 127.0MB in the end (delta: 10.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 2033.57ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 126.5MB in the beginning and 116.4MB in the end (delta: 10.0MB). Peak memory consumption was 45.9MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L22] int counter = 0;
[L24] unsigned int z, k;
[L25] long long x, y, c;
[L26] z = __VERIFIER_nondet_uint()
[L27] k = __VERIFIER_nondet_uint()
[L29] x = 1
[L30] y = z
[L31] c = 1
[L33] EXPR counter++
[L33] COND TRUE counter++<100
[L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0)
[L16] COND FALSE !(!(cond))
[L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0)
[L36] COND TRUE !(c < k)
[L45] x = x * (z - 1)
[L47] CALL __VERIFIER_assert(1 + x - y == 0)
[L16] COND TRUE !(cond)
[L18] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 58 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2022-04-15 09:09:23,420 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...