/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound100.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 12:43:40,868 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 12:43:40,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 12:43:40,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 12:43:40,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 12:43:40,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 12:43:40,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 12:43:40,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 12:43:40,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 12:43:40,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 12:43:40,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 12:43:40,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 12:43:40,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 12:43:40,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 12:43:40,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 12:43:40,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 12:43:40,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 12:43:40,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 12:43:40,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 12:43:40,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 12:43:40,903 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 12:43:40,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 12:43:40,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 12:43:40,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 12:43:40,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 12:43:40,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 12:43:40,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 12:43:40,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 12:43:40,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 12:43:40,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 12:43:40,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 12:43:40,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 12:43:40,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 12:43:40,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 12:43:40,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 12:43:40,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 12:43:40,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 12:43:40,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 12:43:40,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 12:43:40,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 12:43:40,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 12:43:40,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 12:43:40,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 12:43:40,922 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 12:43:40,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 12:43:40,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 12:43:40,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 12:43:40,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 12:43:40,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 12:43:40,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 12:43:40,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 12:43:40,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 12:43:40,924 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 12:43:40,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 12:43:40,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 12:43:40,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 12:43:40,925 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 12:43:40,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 12:43:40,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 12:43:40,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 12:43:40,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 12:43:40,925 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 12:43:40,926 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 12:43:40,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 12:43:40,926 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 12:43:40,926 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 12:43:41,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 12:43:41,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 12:43:41,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 12:43:41,147 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 12:43:41,165 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 12:43:41,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound100.c
[2022-04-08 12:43:41,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42fb91455/bba762fab221435fa1632a7c743b0085/FLAGf911e8069
[2022-04-08 12:43:41,582 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 12:43:41,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/freire2_valuebound100.c
[2022-04-08 12:43:41,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42fb91455/bba762fab221435fa1632a7c743b0085/FLAGf911e8069
[2022-04-08 12:43:41,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42fb91455/bba762fab221435fa1632a7c743b0085
[2022-04-08 12:43:41,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 12:43:41,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 12:43:41,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 12:43:41,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 12:43:41,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 12:43:41,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296bbdf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41, skipping insertion in model container
[2022-04-08 12:43:41,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 12:43:41,618 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 12:43:41,745 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/freire2_valuebound100.c[709,722]
[2022-04-08 12:43:41,761 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 12:43:41,767 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 12:43:41,776 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/freire2_valuebound100.c[709,722]
[2022-04-08 12:43:41,785 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 12:43:41,794 INFO L208 MainTranslator]: Completed translation
[2022-04-08 12:43:41,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41 WrapperNode
[2022-04-08 12:43:41,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 12:43:41,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 12:43:41,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 12:43:41,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 12:43:41,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 12:43:41,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 12:43:41,818 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 12:43:41,818 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 12:43:41,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (1/1) ...
[2022-04-08 12:43:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 12:43:41,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 12:43:41,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 12:43:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 12:43:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 12:43:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 12:43:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 12:43:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 12:43:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 12:43:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 12:43:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 12:43:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 12:43:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 12:43:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 12:43:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double
[2022-04-08 12:43:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 12:43:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 12:43:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 12:43:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 12:43:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 12:43:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 12:43:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 12:43:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 12:43:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 12:43:41,924 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 12:43:41,925 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 12:43:42,060 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 12:43:42,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 12:43:42,065 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 12:43:42,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:43:42 BoogieIcfgContainer
[2022-04-08 12:43:42,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 12:43:42,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 12:43:42,068 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 12:43:42,081 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 12:43:42,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:43:41" (1/3) ...
[2022-04-08 12:43:42,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3767e16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:43:42, skipping insertion in model container
[2022-04-08 12:43:42,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:43:41" (2/3) ...
[2022-04-08 12:43:42,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3767e16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:43:42, skipping insertion in model container
[2022-04-08 12:43:42,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:43:42" (3/3) ...
[2022-04-08 12:43:42,083 INFO L111 eAbstractionObserver]: Analyzing ICFG freire2_valuebound100.c
[2022-04-08 12:43:42,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 12:43:42,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 12:43:42,117 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 12:43:42,124 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 12:43:42,124 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 12:43:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-08 12:43:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 12:43:42,165 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 12:43:42,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 12:43:42,166 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 12:43:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 12:43:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times
[2022-04-08 12:43:42,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 12:43:42,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247125005]
[2022-04-08 12:43:42,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 12:43:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times
[2022-04-08 12:43:42,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 12:43:42,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246053415]
[2022-04-08 12:43:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 12:43:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 12:43:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 12:43:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 12:43:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 12:43:42,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID
[2022-04-08 12:43:42,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID
[2022-04-08 12:43:42,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID
[2022-04-08 12:43:42,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-08 12:43:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 12:43:42,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID
[2022-04-08 12:43:42,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID
[2022-04-08 12:43:42,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID
[2022-04-08 12:43:42,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID
[2022-04-08 12:43:42,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 12:43:42,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID
[2022-04-08 12:43:42,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID
[2022-04-08 12:43:42,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID
[2022-04-08 12:43:42,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID
[2022-04-08 12:43:42,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~r~0;havoc ~a~0;havoc ~x~0;havoc ~s~0;~a~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID
[2022-04-08 12:43:42,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~someBinaryDOUBLEComparisonOperation(~a~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(~a~0, ~convertINTToDOUBLE(100)) then 1 else 0)); {34#true} is VALID
[2022-04-08 12:43:42,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID
[2022-04-08 12:43:42,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID
[2022-04-08 12:43:42,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID
[2022-04-08 12:43:42,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID
[2022-04-08 12:43:42,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~x~0 := ~a~0;~s~0 := 3.25;~r~0 := 1; {35#false} is VALID
[2022-04-08 12:43:42,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID
[2022-04-08 12:43:42,413 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if 1 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(4), ~s~0)) - 12 * ~r~0 * ~r~0 then 1 else 0)); {35#false} is VALID
[2022-04-08 12:43:42,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID
[2022-04-08 12:43:42,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID
[2022-04-08 12:43:42,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID
[2022-04-08 12:43:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 12:43:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 12:43:42,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246053415]
[2022-04-08 12:43:42,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246053415] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 12:43:42,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 12:43:42,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 12:43:42,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 12:43:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247125005]
[2022-04-08 12:43:42,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247125005] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 12:43:42,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 12:43:42,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 12:43:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427873408]
[2022-04-08 12:43:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 12:43:42,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 12:43:42,426 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 12:43:42,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 12:43:42,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 12:43:42,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 12:43:42,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 12:43:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 12:43:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 12:43:42,480 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 12:43:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 12:43:42,643 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions.
[2022-04-08 12:43:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 12:43:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17
[2022-04-08 12:43:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 12:43:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 12:43:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2022-04-08 12:43:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 12:43:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions.
[2022-04-08 12:43:42,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions.
[2022-04-08 12:43:42,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 12:43:42,803 INFO L225 Difference]: With dead ends: 53
[2022-04-08 12:43:42,804 INFO L226 Difference]: Without dead ends: 26
[2022-04-08 12:43:42,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-08 12:43:42,822 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 12:43:42,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 12:43:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2022-04-08 12:43:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2022-04-08 12:43:42,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 12:43:42,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 12:43:42,863 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 12:43:42,863 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 12:43:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 12:43:42,868 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions.
[2022-04-08 12:43:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2022-04-08 12:43:42,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 12:43:42,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 12:43:42,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states.
[2022-04-08 12:43:42,869 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states.
[2022-04-08 12:43:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 12:43:42,871 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions.
[2022-04-08 12:43:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2022-04-08 12:43:42,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 12:43:42,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 12:43:42,872 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 12:43:42,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 12:43:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-08 12:43:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions.
[2022-04-08 12:43:42,875 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17
[2022-04-08 12:43:42,875 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 12:43:42,875 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions.
[2022-04-08 12:43:42,876 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-08 12:43:42,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions.
[2022-04-08 12:43:42,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 12:43:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions.
[2022-04-08 12:43:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-08 12:43:42,909 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 12:43:42,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 12:43:42,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 12:43:42,910 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 12:43:42,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 12:43:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times
[2022-04-08 12:43:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 12:43:42,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506522645]
[2022-04-08 12:43:42,911 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 12:43:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times
[2022-04-08 12:43:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 12:43:42,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051775065]
[2022-04-08 12:43:42,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 12:43:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 12:43:42,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 12:43:42,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481791556]
[2022-04-08 12:43:42,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 12:43:42,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 12:43:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 12:43:42,950 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-08 12:43:42,952 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-08 12:43:42,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 12:43:42,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2022-04-08 12:43:42,990 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-04-08 12:43:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-04-08 12:43:43,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-04-08 12:43:43,010 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace
[2022-04-08 12:43:43,010 INFO L618 BasicCegarLoop]: Counterexample is feasible
[2022-04-08 12:43:43,012 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 12:43:43,031 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-08 12:43:43,227 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-08 12:43:43,229 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2]
[2022-04-08 12:43:43,231 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 12:43:43,240 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2022-04-08 12:43:43,241 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation
[2022-04-08 12:43:43,242 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2022-04-08 12:43:43,243 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2022-04-08 12:43:43,243 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-08 12:43:43,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:43:43 BoogieIcfgContainer
[2022-04-08 12:43:43,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 12:43:43,250 INFO L158 Benchmark]: Toolchain (without parser) took 1649.50ms. Allocated memory was 187.7MB in the beginning and 251.7MB in the end (delta: 64.0MB). Free memory was 136.3MB in the beginning and 159.7MB in the end (delta: -23.5MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB.
[2022-04-08 12:43:43,251 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 12:43:43,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.58ms. Allocated memory was 187.7MB in the beginning and 251.7MB in the end (delta: 64.0MB). Free memory was 136.1MB in the beginning and 227.9MB in the end (delta: -91.8MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB.
[2022-04-08 12:43:43,251 INFO L158 Benchmark]: Boogie Preprocessor took 22.51ms. Allocated memory is still 251.7MB. Free memory was 227.9MB in the beginning and 226.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 12:43:43,252 INFO L158 Benchmark]: RCFGBuilder took 248.70ms. Allocated memory is still 251.7MB. Free memory was 226.3MB in the beginning and 215.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2022-04-08 12:43:43,252 INFO L158 Benchmark]: TraceAbstraction took 1178.73ms. Allocated memory is still 251.7MB. Free memory was 214.8MB in the beginning and 159.7MB in the end (delta: 55.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB.
[2022-04-08 12:43:43,253 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.14ms. Allocated memory is still 187.7MB. Free memory was 152.6MB in the beginning and 152.5MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 195.58ms. Allocated memory was 187.7MB in the beginning and 251.7MB in the end (delta: 64.0MB). Free memory was 136.1MB in the beginning and 227.9MB in the end (delta: -91.8MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 22.51ms. Allocated memory is still 251.7MB. Free memory was 227.9MB in the beginning and 226.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 248.70ms. Allocated memory is still 251.7MB. Free memory was 226.3MB in the beginning and 215.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 1178.73ms. Allocated memory is still 251.7MB. Free memory was 214.8MB in the beginning and 159.7MB in the end (delta: 55.0MB). Peak memory consumption was 54.5MB. 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
- UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable
Unable to prove that call to reach_error is unreachable
Reason: overapproximation of to_int at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 28.
Possible FailurePath:
[L25] int r;
[L26] double a, x, s;
[L27] a = __VERIFIER_nondet_double()
[L28] CALL assume_abort_if_not(a>=0 && a<=100)
[L14] COND FALSE !(!cond)
[L28] RET assume_abort_if_not(a>=0 && a<=100)
[L29] x = a
[L30] s = 3.25
[L31] r = 1
[L33] COND TRUE 1
[L34] CALL __VERIFIER_assert((int)(4*s) - 12*r*r == 1)
[L17] COND TRUE !(cond)
[L19] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 29 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 could not prove your program: unable to determine feasibility of some traces
[2022-04-08 12:43:43,278 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...