/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/hard2_unwindbound10.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 15:50:26,784 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 15:50:26,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 15:50:26,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 15:50:26,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 15:50:26,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 15:50:26,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 15:50:26,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 15:50:26,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 15:50:26,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 15:50:26,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 15:50:26,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 15:50:26,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 15:50:26,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 15:50:26,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 15:50:26,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 15:50:26,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 15:50:26,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 15:50:26,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 15:50:26,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 15:50:26,855 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 15:50:26,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 15:50:26,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 15:50:26,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 15:50:26,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 15:50:26,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 15:50:26,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 15:50:26,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 15:50:26,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 15:50:26,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 15:50:26,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 15:50:26,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 15:50:26,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 15:50:26,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 15:50:26,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 15:50:26,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 15:50:26,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 15:50:26,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 15:50:26,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 15:50:26,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 15:50:26,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 15:50:26,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 15:50:26,873 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-15 15:50:26,881 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 15:50:26,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 15:50:26,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 15:50:26,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 15:50:26,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 15:50:26,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 15:50:26,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 15:50:26,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 15:50:26,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 15:50:26,884 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 15:50:26,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 15:50:26,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 15:50:26,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 15:50:26,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 15:50:26,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 15:50:26,886 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-15 15:50:26,886 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 15:50:27,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 15:50:27,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 15:50:27,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 15:50:27,102 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 15:50:27,103 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 15:50:27,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound10.c
[2022-04-15 15:50:27,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65205eabf/3cd2b36864754dd3bd8c18f6a6f60c3a/FLAG9f8f99cff
[2022-04-15 15:50:27,432 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 15:50:27,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound10.c
[2022-04-15 15:50:27,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65205eabf/3cd2b36864754dd3bd8c18f6a6f60c3a/FLAG9f8f99cff
[2022-04-15 15:50:27,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65205eabf/3cd2b36864754dd3bd8c18f6a6f60c3a
[2022-04-15 15:50:27,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 15:50:27,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 15:50:27,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 15:50:27,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 15:50:27,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 15:50:27,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:50:27" (1/1) ...
[2022-04-15 15:50:27,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce21c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:27, skipping insertion in model container
[2022-04-15 15:50:27,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:50:27" (1/1) ...
[2022-04-15 15:50:27,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 15:50:27,897 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 15:50:28,026 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/hard2_unwindbound10.c[526,539]
[2022-04-15 15:50:28,037 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 15:50:28,050 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 15:50:28,058 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/hard2_unwindbound10.c[526,539]
[2022-04-15 15:50:28,062 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 15:50:28,070 INFO L208 MainTranslator]: Completed translation
[2022-04-15 15:50:28,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28 WrapperNode
[2022-04-15 15:50:28,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 15:50:28,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 15:50:28,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 15:50:28,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 15:50:28,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 15:50:28,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 15:50:28,093 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 15:50:28,093 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 15:50:28,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (1/1) ...
[2022-04-15 15:50:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 15:50:28,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:50:28,129 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 15:50:28,131 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 15:50:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 15:50:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 15:50:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 15:50:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 15:50:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 15:50:28,157 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 15:50:28,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 15:50:28,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 15:50:28,205 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 15:50:28,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 15:50:28,354 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 15:50:28,359 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 15:50:28,359 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-04-15 15:50:28,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:50:28 BoogieIcfgContainer
[2022-04-15 15:50:28,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 15:50:28,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 15:50:28,363 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 15:50:28,371 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 15:50:28,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:50:27" (1/3) ...
[2022-04-15 15:50:28,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25110263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:50:28, skipping insertion in model container
[2022-04-15 15:50:28,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:50:28" (2/3) ...
[2022-04-15 15:50:28,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25110263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:50:28, skipping insertion in model container
[2022-04-15 15:50:28,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:50:28" (3/3) ...
[2022-04-15 15:50:28,373 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound10.c
[2022-04-15 15:50:28,376 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 15:50:28,376 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 15:50:28,408 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 15:50:28,415 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 15:50:28,415 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 15:50:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2022-04-15 15:50:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 15:50:28,447 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:28,447 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:28,448 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times
[2022-04-15 15:50:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:28,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1088478419]
[2022-04-15 15:50:28,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times
[2022-04-15 15:50:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:28,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082556425]
[2022-04-15 15:50:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:50:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:28,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID
[2022-04-15 15:50:28,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID
[2022-04-15 15:50:28,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID
[2022-04-15 15:50:28,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:50:28,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID
[2022-04-15 15:50:28,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID
[2022-04-15 15:50:28,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID
[2022-04-15 15:50:28,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID
[2022-04-15 15:50:28,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID
[2022-04-15 15:50:28,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID
[2022-04-15 15:50:28,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID
[2022-04-15 15:50:28,694 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID
[2022-04-15 15:50:28,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID
[2022-04-15 15:50:28,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID
[2022-04-15 15:50:28,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID
[2022-04-15 15:50:28,696 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 15:50:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:28,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082556425]
[2022-04-15 15:50:28,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082556425] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:28,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 15:50:28,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:28,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1088478419]
[2022-04-15 15:50:28,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1088478419] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:28,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:28,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 15:50:28,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069809051]
[2022-04-15 15:50:28,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:28,711 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 15:50:28,712 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:28,715 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 15:50:28,738 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 15:50:28,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 15:50:28,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:28,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 15:50:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 15:50:28,755 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 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 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 15:50:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:28,951 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions.
[2022-04-15 15:50:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 15:50:28,952 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 15:50:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:28,953 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 15:50:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions.
[2022-04-15 15:50:28,966 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 15:50:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions.
[2022-04-15 15:50:28,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions.
[2022-04-15 15:50:29,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:29,096 INFO L225 Difference]: With dead ends: 57
[2022-04-15 15:50:29,096 INFO L226 Difference]: Without dead ends: 27
[2022-04-15 15:50:29,098 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 15:50:29,100 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:29,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:50:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-15 15:50:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26.
[2022-04-15 15:50:29,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:29,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:29,120 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:29,120 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,123 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions.
[2022-04-15 15:50:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions.
[2022-04-15 15:50:29,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:29,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:29,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states.
[2022-04-15 15:50:29,139 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states.
[2022-04-15 15:50:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,142 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions.
[2022-04-15 15:50:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions.
[2022-04-15 15:50:29,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:29,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:29,143 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:29,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions.
[2022-04-15 15:50:29,147 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12
[2022-04-15 15:50:29,147 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:29,147 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions.
[2022-04-15 15:50:29,147 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 15:50:29,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions.
[2022-04-15 15:50:29,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions.
[2022-04-15 15:50:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2022-04-15 15:50:29,189 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:29,193 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:29,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 15:50:29,194 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times
[2022-04-15 15:50:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:29,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [659424674]
[2022-04-15 15:50:29,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times
[2022-04-15 15:50:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:29,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776196838]
[2022-04-15 15:50:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:50:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:29,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID
[2022-04-15 15:50:29,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID
[2022-04-15 15:50:29,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID
[2022-04-15 15:50:29,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:50:29,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID
[2022-04-15 15:50:29,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID
[2022-04-15 15:50:29,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID
[2022-04-15 15:50:29,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID
[2022-04-15 15:50:29,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID
[2022-04-15 15:50:29,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID
[2022-04-15 15:50:29,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 10);havoc #t~post5; {267#(= main_~q~0 0)} is VALID
[2022-04-15 15:50:29,286 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 15:50:29,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 15:50:29,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID
[2022-04-15 15:50:29,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID
[2022-04-15 15:50:29,287 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 15:50:29,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776196838]
[2022-04-15 15:50:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776196838] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:50:29,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [659424674]
[2022-04-15 15:50:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [659424674] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:29,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:29,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:50:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258450150]
[2022-04-15 15:50:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:29,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,290 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:29,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,299 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 15:50:29,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 15:50:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:29,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 15:50:29,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-15 15:50:29,300 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,582 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions.
[2022-04-15 15:50:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 15:50:29,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions.
[2022-04-15 15:50:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions.
[2022-04-15 15:50:29,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions.
[2022-04-15 15:50:29,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:29,641 INFO L225 Difference]: With dead ends: 41
[2022-04-15 15:50:29,641 INFO L226 Difference]: Without dead ends: 39
[2022-04-15 15:50:29,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2022-04-15 15:50:29,644 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:29,644 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 15:50:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2022-04-15 15:50:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30.
[2022-04-15 15:50:29,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:29,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-15 15:50:29,653 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-15 15:50:29,653 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-15 15:50:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,655 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions.
[2022-04-15 15:50:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions.
[2022-04-15 15:50:29,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:29,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:29,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 39 states.
[2022-04-15 15:50:29,656 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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 39 states.
[2022-04-15 15:50:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,658 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions.
[2022-04-15 15:50:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions.
[2022-04-15 15:50:29,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:29,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:29,659 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:29,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-15 15:50:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions.
[2022-04-15 15:50:29,661 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12
[2022-04-15 15:50:29,661 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:29,661 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions.
[2022-04-15 15:50:29,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 15:50:29,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions.
[2022-04-15 15:50:29,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions.
[2022-04-15 15:50:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-15 15:50:29,696 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:29,696 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:29,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-15 15:50:29,697 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times
[2022-04-15 15:50:29,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:29,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227134955]
[2022-04-15 15:50:29,702 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times
[2022-04-15 15:50:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:29,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263029378]
[2022-04-15 15:50:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:50:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:29,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:50:29,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:29,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID
[2022-04-15 15:50:29,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {502#false} is VALID
[2022-04-15 15:50:29,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID
[2022-04-15 15:50:29,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 10);havoc #t~post6; {502#false} is VALID
[2022-04-15 15:50:29,771 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID
[2022-04-15 15:50:29,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID
[2022-04-15 15:50:29,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID
[2022-04-15 15:50:29,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID
[2022-04-15 15:50:29,772 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 15:50:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263029378]
[2022-04-15 15:50:29,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263029378] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:29,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:29,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 15:50:29,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:29,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1227134955]
[2022-04-15 15:50:29,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1227134955] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:29,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:29,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 15:50:29,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030581951]
[2022-04-15 15:50:29,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2022-04-15 15:50:29,774 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:29,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 15:50:29,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:29,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 15:50:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 15:50:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:50:29,805 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 15:50:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,945 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions.
[2022-04-15 15:50:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2022-04-15 15:50:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2022-04-15 15:50:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 15:50:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions.
[2022-04-15 15:50:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 15:50:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions.
[2022-04-15 15:50:29,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions.
[2022-04-15 15:50:29,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:29,986 INFO L225 Difference]: With dead ends: 46
[2022-04-15 15:50:29,986 INFO L226 Difference]: Without dead ends: 32
[2022-04-15 15:50:29,987 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:50:29,987 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:29,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:50:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2022-04-15 15:50:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2022-04-15 15:50:29,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:29,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-15 15:50:29,996 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-15 15:50:29,996 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-15 15:50:29,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:29,998 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions.
[2022-04-15 15:50:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions.
[2022-04-15 15:50:29,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:29,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:29,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 32 states.
[2022-04-15 15:50:29,998 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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 32 states.
[2022-04-15 15:50:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:30,000 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions.
[2022-04-15 15:50:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions.
[2022-04-15 15:50:30,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:30,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:30,000 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:30,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-15 15:50:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions.
[2022-04-15 15:50:30,002 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14
[2022-04-15 15:50:30,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:30,002 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions.
[2022-04-15 15:50:30,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 15:50:30,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions.
[2022-04-15 15:50:30,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions.
[2022-04-15 15:50:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2022-04-15 15:50:30,036 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:30,036 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:30,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-15 15:50:30,036 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times
[2022-04-15 15:50:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291864039]
[2022-04-15 15:50:30,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times
[2022-04-15 15:50:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:30,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450847895]
[2022-04-15 15:50:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:50:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:30,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID
[2022-04-15 15:50:30,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID
[2022-04-15 15:50:30,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID
[2022-04-15 15:50:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2022-04-15 15:50:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:30,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID
[2022-04-15 15:50:30,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID
[2022-04-15 15:50:30,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID
[2022-04-15 15:50:30,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID
[2022-04-15 15:50:30,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:50:30,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID
[2022-04-15 15:50:30,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID
[2022-04-15 15:50:30,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID
[2022-04-15 15:50:30,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID
[2022-04-15 15:50:30,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID
[2022-04-15 15:50:30,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID
[2022-04-15 15:50:30,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 10);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID
[2022-04-15 15:50:30,113 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID
[2022-04-15 15:50:30,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID
[2022-04-15 15:50:30,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID
[2022-04-15 15:50:30,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID
[2022-04-15 15:50:30,114 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID
[2022-04-15 15:50:30,114 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 15:50:30,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 15:50:30,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID
[2022-04-15 15:50:30,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID
[2022-04-15 15:50:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-15 15:50:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450847895]
[2022-04-15 15:50:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450847895] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:30,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:30,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:50:30,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291864039]
[2022-04-15 15:50:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291864039] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:30,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:30,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:50:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710325726]
[2022-04-15 15:50:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:30,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17
[2022-04-15 15:50:30,117 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:30,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:50:30,127 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-15 15:50:30,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 15:50:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 15:50:30,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-15 15:50:30,127 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:50:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:30,389 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions.
[2022-04-15 15:50:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 15:50:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17
[2022-04-15 15:50:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:50:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions.
[2022-04-15 15:50:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:50:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions.
[2022-04-15 15:50:30,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions.
[2022-04-15 15:50:30,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:30,435 INFO L225 Difference]: With dead ends: 46
[2022-04-15 15:50:30,435 INFO L226 Difference]: Without dead ends: 44
[2022-04-15 15:50:30,435 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2022-04-15 15:50:30,436 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:30,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 15:50:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2022-04-15 15:50:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36.
[2022-04-15 15:50:30,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:30,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:30,445 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:30,445 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:30,447 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions.
[2022-04-15 15:50:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions.
[2022-04-15 15:50:30,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:30,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:30,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states.
[2022-04-15 15:50:30,448 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states.
[2022-04-15 15:50:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:30,449 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions.
[2022-04-15 15:50:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions.
[2022-04-15 15:50:30,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:30,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:30,450 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:30,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2022-04-15 15:50:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions.
[2022-04-15 15:50:30,451 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17
[2022-04-15 15:50:30,451 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:30,451 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions.
[2022-04-15 15:50:30,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:50:30,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions.
[2022-04-15 15:50:30,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions.
[2022-04-15 15:50:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2022-04-15 15:50:30,481 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:30,481 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:30,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-15 15:50:30,481 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times
[2022-04-15 15:50:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:30,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1464081412]
[2022-04-15 15:50:30,482 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times
[2022-04-15 15:50:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:30,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670622986]
[2022-04-15 15:50:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:30,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:50:30,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323522613]
[2022-04-15 15:50:30,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:50:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:50:30,494 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 15:50:30,522 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 15:50:30,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 15:50:30,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:50:30,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core
[2022-04-15 15:50:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:30,584 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:50:30,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID
[2022-04-15 15:50:30,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID
[2022-04-15 15:50:30,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID
[2022-04-15 15:50:30,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID
[2022-04-15 15:50:30,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID
[2022-04-15 15:50:30,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:50:30,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:50:30,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:50:30,773 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID
[2022-04-15 15:50:30,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID
[2022-04-15 15:50:30,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID
[2022-04-15 15:50:30,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID
[2022-04-15 15:50:30,774 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:50:30,774 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID
[2022-04-15 15:50:30,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID
[2022-04-15 15:50:30,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID
[2022-04-15 15:50:30,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID
[2022-04-15 15:50:30,775 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:50:30,775 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 15:50:30,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 15:50:30,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID
[2022-04-15 15:50:30,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID
[2022-04-15 15:50:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 15:50:30,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:50:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:30,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670622986]
[2022-04-15 15:50:30,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:50:30,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323522613]
[2022-04-15 15:50:30,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323522613] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:30,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:30,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:30,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:30,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1464081412]
[2022-04-15 15:50:30,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1464081412] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:30,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:30,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175630671]
[2022-04-15 15:50:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:30,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-15 15:50:30,779 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:30,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 15:50:30,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:30,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 15:50:30,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 15:50:30,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:50:30,794 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 15:50:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:30,944 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions.
[2022-04-15 15:50:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 15:50:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22
[2022-04-15 15:50:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 15:50:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2022-04-15 15:50:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 15:50:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions.
[2022-04-15 15:50:30,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions.
[2022-04-15 15:50:31,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:31,012 INFO L225 Difference]: With dead ends: 65
[2022-04-15 15:50:31,012 INFO L226 Difference]: Without dead ends: 50
[2022-04-15 15:50:31,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 15:50:31,013 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:31,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:50:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2022-04-15 15:50:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2022-04-15 15:50:31,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:31,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,042 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,043 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:31,047 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions.
[2022-04-15 15:50:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions.
[2022-04-15 15:50:31,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:31,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:31,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states.
[2022-04-15 15:50:31,048 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states.
[2022-04-15 15:50:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:31,051 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions.
[2022-04-15 15:50:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions.
[2022-04-15 15:50:31,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:31,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:31,051 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:31,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions.
[2022-04-15 15:50:31,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22
[2022-04-15 15:50:31,055 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:31,055 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions.
[2022-04-15 15:50:31,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 15:50:31,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions.
[2022-04-15 15:50:31,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions.
[2022-04-15 15:50:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-15 15:50:31,098 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:31,098 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:31,126 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 15:50:31,328 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:31,329 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:31,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times
[2022-04-15 15:50:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:31,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867255439]
[2022-04-15 15:50:31,330 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times
[2022-04-15 15:50:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:31,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423176372]
[2022-04-15 15:50:31,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:31,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:50:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648428046]
[2022-04-15 15:50:31,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:50:31,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:50:31,341 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 15:50:31,342 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 15:50:31,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 15:50:31,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:50:31,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 15:50:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:31,382 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:50:31,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID
[2022-04-15 15:50:31,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:31,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:31,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:31,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:31,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID
[2022-04-15 15:50:31,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,571 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,574 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,575 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,576 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,577 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,578 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID
[2022-04-15 15:50:31,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID
[2022-04-15 15:50:31,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1411#false} is VALID
[2022-04-15 15:50:31,581 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID
[2022-04-15 15:50:31,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID
[2022-04-15 15:50:31,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID
[2022-04-15 15:50:31,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID
[2022-04-15 15:50:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-15 15:50:31,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:50:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423176372]
[2022-04-15 15:50:31,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:50:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648428046]
[2022-04-15 15:50:31,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648428046] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:31,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:31,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:31,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867255439]
[2022-04-15 15:50:31,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867255439] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:31,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:31,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550126561]
[2022-04-15 15:50:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:31,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30
[2022-04-15 15:50:31,583 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:31,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:31,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:31,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 15:50:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 15:50:31,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:50:31,623 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:31,713 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions.
[2022-04-15 15:50:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 15:50:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30
[2022-04-15 15:50:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions.
[2022-04-15 15:50:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions.
[2022-04-15 15:50:31,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions.
[2022-04-15 15:50:31,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:31,748 INFO L225 Difference]: With dead ends: 70
[2022-04-15 15:50:31,748 INFO L226 Difference]: Without dead ends: 63
[2022-04-15 15:50:31,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:50:31,749 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:31,749 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:50:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2022-04-15 15:50:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62.
[2022-04-15 15:50:31,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:31,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,774 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,774 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:31,776 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions.
[2022-04-15 15:50:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions.
[2022-04-15 15:50:31,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:31,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:31,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states.
[2022-04-15 15:50:31,777 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states.
[2022-04-15 15:50:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:31,778 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions.
[2022-04-15 15:50:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions.
[2022-04-15 15:50:31,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:31,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:31,779 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:31,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2022-04-15 15:50:31,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions.
[2022-04-15 15:50:31,780 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30
[2022-04-15 15:50:31,781 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:31,781 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions.
[2022-04-15 15:50:31,781 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:31,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions.
[2022-04-15 15:50:31,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions.
[2022-04-15 15:50:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2022-04-15 15:50:31,853 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:31,853 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:31,872 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 15:50:32,061 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,SelfDestructingSolverStorable5
[2022-04-15 15:50:32,062 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times
[2022-04-15 15:50:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:32,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1974572512]
[2022-04-15 15:50:32,063 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:50:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times
[2022-04-15 15:50:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:32,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086929655]
[2022-04-15 15:50:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:32,079 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:50:32,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845674693]
[2022-04-15 15:50:32,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:50:32,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:32,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:50:32,081 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 15:50:32,082 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 15:50:32,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 15:50:32,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:50:32,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 15:50:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:32,125 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:50:32,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID
[2022-04-15 15:50:32,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID
[2022-04-15 15:50:32,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID
[2022-04-15 15:50:32,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID
[2022-04-15 15:50:32,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID
[2022-04-15 15:50:32,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,232 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID
[2022-04-15 15:50:32,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID
[2022-04-15 15:50:32,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID
[2022-04-15 15:50:32,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID
[2022-04-15 15:50:32,233 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,233 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID
[2022-04-15 15:50:32,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID
[2022-04-15 15:50:32,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID
[2022-04-15 15:50:32,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID
[2022-04-15 15:50:32,234 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,234 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID
[2022-04-15 15:50:32,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID
[2022-04-15 15:50:32,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID
[2022-04-15 15:50:32,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID
[2022-04-15 15:50:32,235 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:50:32,237 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 15:50:32,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 15:50:32,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID
[2022-04-15 15:50:32,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID
[2022-04-15 15:50:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2022-04-15 15:50:32,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:50:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086929655]
[2022-04-15 15:50:32,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:50:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845674693]
[2022-04-15 15:50:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845674693] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:32,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:32,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:32,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:32,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1974572512]
[2022-04-15 15:50:32,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1974572512] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:32,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:32,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255328240]
[2022-04-15 15:50:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30
[2022-04-15 15:50:32,240 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:32,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:32,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:32,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 15:50:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 15:50:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:50:32,255 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:32,390 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions.
[2022-04-15 15:50:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 15:50:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30
[2022-04-15 15:50:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:50:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions.
[2022-04-15 15:50:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:32,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions.
[2022-04-15 15:50:32,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions.
[2022-04-15 15:50:32,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:50:32,426 INFO L225 Difference]: With dead ends: 76
[2022-04-15 15:50:32,426 INFO L226 Difference]: Without dead ends: 64
[2022-04-15 15:50:32,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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 15:50:32,427 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:50:32,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:50:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2022-04-15 15:50:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63.
[2022-04-15 15:50:32,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:50:32,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:50:32,468 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:50:32,468 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:50:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:32,472 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions.
[2022-04-15 15:50:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions.
[2022-04-15 15:50:32,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:32,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:32,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states.
[2022-04-15 15:50:32,472 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states.
[2022-04-15 15:50:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:50:32,474 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions.
[2022-04-15 15:50:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions.
[2022-04-15 15:50:32,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:50:32,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:50:32,475 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:50:32,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:50:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:50:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions.
[2022-04-15 15:50:32,477 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30
[2022-04-15 15:50:32,477 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:50:32,477 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions.
[2022-04-15 15:50:32,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2022-04-15 15:50:32,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions.
[2022-04-15 15:50:32,536 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-15 15:50:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions.
[2022-04-15 15:50:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2022-04-15 15:50:32,538 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:50:32,538 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:50:32,555 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 15:50:32,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:32,751 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:50:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:50:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times
[2022-04-15 15:50:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:50:32,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389270533]
[2022-04-15 15:50:35,476 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE
[2022-04-15 15:50:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -861149586, now seen corresponding path program 1 times
[2022-04-15 15:50:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:50:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996922100]
[2022-04-15 15:50:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:50:35,486 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:50:35,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [235418864]
[2022-04-15 15:50:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:50:35,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:50:35,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 15:50:35,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2022-04-15 15:50:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:35,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core
[2022-04-15 15:50:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:50:35,532 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:50:35,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID
[2022-04-15 15:50:35,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2396#true} is VALID
[2022-04-15 15:50:35,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {2396#true} assume true; {2396#true} is VALID
[2022-04-15 15:50:35,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2396#true} {2396#true} #92#return; {2396#true} is VALID
[2022-04-15 15:50:35,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {2396#true} call #t~ret7 := main(); {2396#true} is VALID
[2022-04-15 15:50:35,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {2396#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} [96] L34-3-->L34-1_primed: Formula: (let ((.cse0 (= v_main_~d~0_In_1 v_main_~d~0_Out_2))) (or (and (= v_main_~A~0_In_1 v_main_~A~0_In_1) .cse0 (= v_main_~B~0_In_1 v_main_~B~0_In_1) (= v_main_~r~0_In_1 v_main_~r~0_In_1) (= v_main_~q~0_In_1 v_main_~q~0_In_1) (= v_main_~p~0_In_1 v_main_~p~0_Out_2)) (let ((.cse1 (* v_main_~B~0_In_1 (div (* (- 1) v_main_~p~0_Out_2) (- 2))))) (and (= (* .cse1 2) v_main_~d~0_Out_2) (< v_~counter~0_Out_2 11) (= 0 (mod v_main_~p~0_Out_2 2)) .cse0 (= v_main_~d~0_Out_2 0) (= v_main_~r~0_In_1 0) (= v_main_~r~0_In_1 v_main_~A~0_In_1) (<= .cse1 v_main_~r~0_In_1) (= v_main_~p~0_Out_2 0) (= v_main_~q~0_In_1 0) (= v_main_~p~0_Out_2 v_main_~p~0_In_1) (= v_main_~A~0_In_1 0) (= v_main_~B~0_In_1 0))))) InVars {main_~q~0=v_main_~q~0_In_1, main_~d~0=v_main_~d~0_In_1, main_~B~0=v_main_~B~0_In_1, main_~A~0=v_main_~A~0_In_1, main_~p~0=v_main_~p~0_In_1, main_~r~0=v_main_~r~0_In_1} OutVars{main_~q~0=v_main_~q~0_In_1, ~counter~0=v_~counter~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~d~0=v_main_~d~0_Out_2, main_~B~0=v_main_~B~0_In_1, main_~A~0=v_main_~A~0_In_1, main_~p~0=v_main_~p~0_Out_2, main_~r~0=v_main_~r~0_In_1} AuxVars[] AssignedVars[~counter~0, main_#t~post5, main_~d~0, main_~p~0] {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} [95] L34-1_primed-->L34-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} assume !(#t~post5 < 10);havoc #t~post5; {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} assume !(#t~post6 < 10);havoc #t~post6; {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,630 INFO L272 TraceCheckUtils]: 11: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID
[2022-04-15 15:50:35,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID
[2022-04-15 15:50:35,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID
[2022-04-15 15:50:35,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} assume true; {2396#true} is VALID
[2022-04-15 15:50:35,631 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2396#true} {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} #88#return; {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:50:35,632 INFO L272 TraceCheckUtils]: 16: Hoare triple {2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 15:50:35,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2454#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 15:50:35,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {2454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2397#false} is VALID
[2022-04-15 15:50:35,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {2397#false} assume !false; {2397#false} is VALID
[2022-04-15 15:50:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-15 15:50:35,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:50:35,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:50:35,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996922100]
[2022-04-15 15:50:35,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:50:35,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235418864]
[2022-04-15 15:50:35,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235418864] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:35,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:35,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:50:40,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:50:40,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389270533]
[2022-04-15 15:50:40,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389270533] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:50:40,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:50:40,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-04-15 15:50:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071617324]
[2022-04-15 15:50:40,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:50:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 37
[2022-04-15 15:50:40,462 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:50:40,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-15 15:50:40,926 WARN L143 InductivityCheck]: Transition 2466#(and (< ~counter~0 11) (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0)) ( _ , #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; , 2416#(and (= main_~B~0 1) (= main_~B~0 main_~d~0)) ) not inductive
[2022-04-15 15:50:40,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2022-04-15 15:50:41,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:50:41,127 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError: inductivity failed
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.<init>(InductivityCheck.java:75)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:153)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2022-04-15 15:50:41,130 INFO L158 Benchmark]: Toolchain (without parser) took 13257.06ms. Allocated memory is still 203.4MB. Free memory was 156.0MB in the beginning and 144.4MB in the end (delta: 11.6MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB.
[2022-04-15 15:50:41,130 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 15:50:41,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.89ms. Allocated memory is still 203.4MB. Free memory was 155.8MB in the beginning and 181.9MB in the end (delta: -26.2MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB.
[2022-04-15 15:50:41,130 INFO L158 Benchmark]: Boogie Preprocessor took 21.47ms. Allocated memory is still 203.4MB. Free memory was 181.9MB in the beginning and 180.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-15 15:50:41,131 INFO L158 Benchmark]: RCFGBuilder took 267.15ms. Allocated memory is still 203.4MB. Free memory was 180.3MB in the beginning and 168.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 15:50:41,131 INFO L158 Benchmark]: TraceAbstraction took 12766.95ms. Allocated memory is still 203.4MB. Free memory was 168.2MB in the beginning and 144.4MB in the end (delta: 23.8MB). Peak memory consumption was 24.6MB. Max. memory is 8.0GB.
[2022-04-15 15:50:41,132 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.15ms. Allocated memory is still 203.4MB. Free memory is still 172.3MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 190.89ms. Allocated memory is still 203.4MB. Free memory was 155.8MB in the beginning and 181.9MB in the end (delta: -26.2MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 21.47ms. Allocated memory is still 203.4MB. Free memory was 181.9MB in the beginning and 180.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 267.15ms. Allocated memory is still 203.4MB. Free memory was 180.3MB in the beginning and 168.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 12766.95ms. Allocated memory is still 203.4MB. Free memory was 168.2MB in the beginning and 144.4MB in the end (delta: 23.8MB). Peak memory consumption was 24.6MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: AssertionError: inductivity failed
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2022-04-15 15:50:41,157 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...