/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/hard-u_unwindbound5.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 15:39:07,339 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 15:39:07,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 15:39:07,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 15:39:07,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 15:39:07,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 15:39:07,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 15:39:07,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 15:39:07,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 15:39:07,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 15:39:07,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 15:39:07,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 15:39:07,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 15:39:07,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 15:39:07,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 15:39:07,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 15:39:07,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 15:39:07,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 15:39:07,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 15:39:07,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 15:39:07,424 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 15:39:07,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 15:39:07,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 15:39:07,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 15:39:07,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 15:39:07,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 15:39:07,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 15:39:07,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 15:39:07,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 15:39:07,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 15:39:07,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 15:39:07,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 15:39:07,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 15:39:07,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 15:39:07,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 15:39:07,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 15:39:07,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 15:39:07,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 15:39:07,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 15:39:07,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 15:39:07,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 15:39:07,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 15:39:07,440 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:39:07,447 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 15:39:07,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 15:39:07,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 15:39:07,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 15:39:07,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 15:39:07,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 15:39:07,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 15:39:07,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 15:39:07,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 15:39:07,449 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 15:39:07,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 15:39:07,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 15:39:07,450 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 15:39:07,451 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 15:39:07,451 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 15:39:07,451 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-15 15:39:07,451 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:39:07,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 15:39:07,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 15:39:07,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 15:39:07,663 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 15:39:07,663 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 15:39:07,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c
[2022-04-15 15:39:07,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f1c2fd3/6edbd0a910ad41ae8d5dff41ffded07b/FLAGf3bbde8d1
[2022-04-15 15:39:08,074 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 15:39:08,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound5.c
[2022-04-15 15:39:08,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f1c2fd3/6edbd0a910ad41ae8d5dff41ffded07b/FLAGf3bbde8d1
[2022-04-15 15:39:08,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f1c2fd3/6edbd0a910ad41ae8d5dff41ffded07b
[2022-04-15 15:39:08,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 15:39:08,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 15:39:08,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 15:39:08,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 15:39:08,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 15:39:08,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d4ef2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08, skipping insertion in model container
[2022-04-15 15:39:08,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 15:39:08,119 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 15:39:08,254 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/hard-u_unwindbound5.c[537,550]
[2022-04-15 15:39:08,283 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 15:39:08,292 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 15:39:08,303 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/hard-u_unwindbound5.c[537,550]
[2022-04-15 15:39:08,318 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 15:39:08,328 INFO L208 MainTranslator]: Completed translation
[2022-04-15 15:39:08,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08 WrapperNode
[2022-04-15 15:39:08,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 15:39:08,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 15:39:08,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 15:39:08,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 15:39:08,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 15:39:08,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 15:39:08,377 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 15:39:08,377 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 15:39:08,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (1/1) ...
[2022-04-15 15:39:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 15:39:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:39:08,407 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:39:08,421 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:39:08,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 15:39:08,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 15:39:08,438 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 15:39:08,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 15:39:08,439 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 15:39:08,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 15:39:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 15:39:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 15:39:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 15:39:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 15:39:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-15 15:39:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 15:39:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 15:39:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 15:39:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 15:39:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 15:39:08,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 15:39:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 15:39:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 15:39:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 15:39:08,480 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 15:39:08,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 15:39:08,670 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 15:39:08,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 15:39:08,674 INFO L299 CfgBuilder]: Removed 2 assume(true) statements.
[2022-04-15 15:39:08,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:39:08 BoogieIcfgContainer
[2022-04-15 15:39:08,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 15:39:08,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 15:39:08,677 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 15:39:08,682 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 15:39:08,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:39:08" (1/3) ...
[2022-04-15 15:39:08,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103791f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:39:08, skipping insertion in model container
[2022-04-15 15:39:08,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:08" (2/3) ...
[2022-04-15 15:39:08,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103791f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:39:08, skipping insertion in model container
[2022-04-15 15:39:08,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:39:08" (3/3) ...
[2022-04-15 15:39:08,684 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound5.c
[2022-04-15 15:39:08,687 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 15:39:08,688 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 15:39:08,722 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 15:39:08,729 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:39:08,729 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 15:39:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2022-04-15 15:39:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-15 15:39:08,748 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:08,749 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:39:08,750 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times
[2022-04-15 15:39:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:08,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17114423]
[2022-04-15 15:39:08,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times
[2022-04-15 15:39:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:08,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288083895]
[2022-04-15 15:39:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:08,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:08,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:39:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:08,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID
[2022-04-15 15:39:08,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID
[2022-04-15 15:39:08,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID
[2022-04-15 15:39:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 15:39:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:08,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 15:39:08,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 15:39:08,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 15:39:08,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID
[2022-04-15 15:39:08,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:39:08,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID
[2022-04-15 15:39:08,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID
[2022-04-15 15:39:08,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID
[2022-04-15 15:39:08,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID
[2022-04-15 15:39:08,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID
[2022-04-15 15:39:08,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID
[2022-04-15 15:39:08,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID
[2022-04-15 15:39:08,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID
[2022-04-15 15:39:08,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID
[2022-04-15 15:39:08,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID
[2022-04-15 15:39:08,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID
[2022-04-15 15:39:08,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID
[2022-04-15 15:39:08,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID
[2022-04-15 15:39:08,948 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID
[2022-04-15 15:39:08,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID
[2022-04-15 15:39:08,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID
[2022-04-15 15:39:08,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID
[2022-04-15 15:39:08,948 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:39:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:08,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288083895]
[2022-04-15 15:39:08,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288083895] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:08,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:08,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 15:39:08,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17114423]
[2022-04-15 15:39:08,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17114423] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:08,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:08,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-15 15:39:08,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825756372]
[2022-04-15 15:39:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:08,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2022-04-15 15:39:08,956 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:08,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:08,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:08,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-15 15:39:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-15 15:39:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 15:39:09,003 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:09,189 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions.
[2022-04-15 15:39:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-15 15:39:09,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2022-04-15 15:39:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions.
[2022-04-15 15:39:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions.
[2022-04-15 15:39:09,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions.
[2022-04-15 15:39:09,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:09,299 INFO L225 Difference]: With dead ends: 66
[2022-04-15 15:39:09,299 INFO L226 Difference]: Without dead ends: 33
[2022-04-15 15:39:09,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-15 15:39:09,303 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:09,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:39:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2022-04-15 15:39:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32.
[2022-04-15 15:39:09,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:09,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:09,324 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:09,324 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:09,327 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions.
[2022-04-15 15:39:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions.
[2022-04-15 15:39:09,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:09,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:09,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states.
[2022-04-15 15:39:09,328 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states.
[2022-04-15 15:39:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:09,331 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions.
[2022-04-15 15:39:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions.
[2022-04-15 15:39:09,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:09,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:09,331 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:09,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions.
[2022-04-15 15:39:09,338 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18
[2022-04-15 15:39:09,338 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:09,338 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions.
[2022-04-15 15:39:09,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions.
[2022-04-15 15:39:09,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2022-04-15 15:39:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-15 15:39:09,370 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:09,370 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:39:09,371 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 15:39:09,371 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times
[2022-04-15 15:39:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147008435]
[2022-04-15 15:39:09,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times
[2022-04-15 15:39:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:09,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019067617]
[2022-04-15 15:39:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:39:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:09,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID
[2022-04-15 15:39:09,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID
[2022-04-15 15:39:09,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID
[2022-04-15 15:39:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 15:39:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:09,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID
[2022-04-15 15:39:09,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID
[2022-04-15 15:39:09,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID
[2022-04-15 15:39:09,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID
[2022-04-15 15:39:09,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:39:09,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID
[2022-04-15 15:39:09,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID
[2022-04-15 15:39:09,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID
[2022-04-15 15:39:09,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID
[2022-04-15 15:39:09,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {314#true} is VALID
[2022-04-15 15:39:09,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID
[2022-04-15 15:39:09,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID
[2022-04-15 15:39:09,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID
[2022-04-15 15:39:09,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID
[2022-04-15 15:39:09,507 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID
[2022-04-15 15:39:09,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID
[2022-04-15 15:39:09,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID
[2022-04-15 15:39:09,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 5);havoc #t~post6; {323#(= main_~q~0 0)} is VALID
[2022-04-15 15:39:09,509 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 15:39:09,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 15:39:09,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID
[2022-04-15 15:39:09,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID
[2022-04-15 15:39:09,513 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:39:09,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019067617]
[2022-04-15 15:39:09,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019067617] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:09,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:09,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:39:09,516 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147008435]
[2022-04-15 15:39:09,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147008435] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:09,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:09,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:39:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220640307]
[2022-04-15 15:39:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:09,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2022-04-15 15:39:09,518 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:09,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:09,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 15:39:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 15:39:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-15 15:39:09,537 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:09,912 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions.
[2022-04-15 15:39:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 15:39:09,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18
[2022-04-15 15:39:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions.
[2022-04-15 15:39:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions.
[2022-04-15 15:39:09,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions.
[2022-04-15 15:39:09,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:09,993 INFO L225 Difference]: With dead ends: 47
[2022-04-15 15:39:09,993 INFO L226 Difference]: Without dead ends: 45
[2022-04-15 15:39:09,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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:39:09,994 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:09,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 15:39:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2022-04-15 15:39:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36.
[2022-04-15 15:39:10,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:10,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,000 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,001 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:10,003 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions.
[2022-04-15 15:39:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions.
[2022-04-15 15:39:10,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:10,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:10,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states.
[2022-04-15 15:39:10,004 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states.
[2022-04-15 15:39:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:10,007 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions.
[2022-04-15 15:39:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions.
[2022-04-15 15:39:10,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:10,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:10,007 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:10,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions.
[2022-04-15 15:39:10,009 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18
[2022-04-15 15:39:10,009 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:10,010 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions.
[2022-04-15 15:39:10,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2022-04-15 15:39:10,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions.
[2022-04-15 15:39:10,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions.
[2022-04-15 15:39:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2022-04-15 15:39:10,047 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:10,047 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:39:10,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-15 15:39:10,048 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times
[2022-04-15 15:39:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:10,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1686907998]
[2022-04-15 15:39:10,049 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times
[2022-04-15 15:39:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:10,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658814903]
[2022-04-15 15:39:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:10,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:39:10,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841997406]
[2022-04-15 15:39:10,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:39:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:39:10,062 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:39:10,065 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:39:10,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 15:39:10,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:39:10,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core
[2022-04-15 15:39:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:10,125 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:39:10,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID
[2022-04-15 15:39:10,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:10,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID
[2022-04-15 15:39:10,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {594#false} is VALID
[2022-04-15 15:39:10,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID
[2022-04-15 15:39:10,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 5);havoc #t~post7; {594#false} is VALID
[2022-04-15 15:39:10,242 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {594#false} is VALID
[2022-04-15 15:39:10,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID
[2022-04-15 15:39:10,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID
[2022-04-15 15:39:10,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID
[2022-04-15 15:39:10,243 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:39:10,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:39:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:10,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658814903]
[2022-04-15 15:39:10,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:39:10,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841997406]
[2022-04-15 15:39:10,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841997406] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:10,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:10,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 15:39:10,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1686907998]
[2022-04-15 15:39:10,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1686907998] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:10,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:10,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 15:39:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701308247]
[2022-04-15 15:39:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-15 15:39:10,245 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:10,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:39:10,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:10,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 15:39:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 15:39:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 15:39:10,258 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:39:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:10,343 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions.
[2022-04-15 15:39:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-15 15:39:10,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20
[2022-04-15 15:39:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:39:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions.
[2022-04-15 15:39:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:39:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions.
[2022-04-15 15:39:10,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions.
[2022-04-15 15:39:10,395 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:39:10,400 INFO L225 Difference]: With dead ends: 52
[2022-04-15 15:39:10,400 INFO L226 Difference]: Without dead ends: 38
[2022-04-15 15:39:10,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 15:39:10,404 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:10,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:39:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2022-04-15 15:39:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2022-04-15 15:39:10,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:10,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,426 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,427 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:10,428 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions.
[2022-04-15 15:39:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions.
[2022-04-15 15:39:10,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:10,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:10,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states.
[2022-04-15 15:39:10,430 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states.
[2022-04-15 15:39:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:10,435 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions.
[2022-04-15 15:39:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions.
[2022-04-15 15:39:10,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:10,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:10,443 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:10,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions.
[2022-04-15 15:39:10,445 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20
[2022-04-15 15:39:10,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:10,445 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions.
[2022-04-15 15:39:10,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-15 15:39:10,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions.
[2022-04-15 15:39:10,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions.
[2022-04-15 15:39:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-15 15:39:10,478 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:10,478 INFO L499 BasicCegarLoop]: trace histogram [2, 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:39:10,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-15 15:39:10,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:10,696 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times
[2022-04-15 15:39:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656780978]
[2022-04-15 15:39:10,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times
[2022-04-15 15:39:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:10,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563320448]
[2022-04-15 15:39:10,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:10,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 15:39:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:10,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID
[2022-04-15 15:39:10,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID
[2022-04-15 15:39:10,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID
[2022-04-15 15:39:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2022-04-15 15:39:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:10,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID
[2022-04-15 15:39:10,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID
[2022-04-15 15:39:10,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID
[2022-04-15 15:39:10,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID
[2022-04-15 15:39:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2022-04-15 15:39:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:10,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID
[2022-04-15 15:39:10,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID
[2022-04-15 15:39:10,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID
[2022-04-15 15:39:10,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID
[2022-04-15 15:39:10,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-15 15:39:10,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID
[2022-04-15 15:39:10,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID
[2022-04-15 15:39:10,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID
[2022-04-15 15:39:10,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID
[2022-04-15 15:39:10,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID
[2022-04-15 15:39:10,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID
[2022-04-15 15:39:10,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 5);havoc #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID
[2022-04-15 15:39:10,807 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {912#true} is VALID
[2022-04-15 15:39:10,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID
[2022-04-15 15:39:10,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID
[2022-04-15 15:39:10,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID
[2022-04-15 15:39:10,808 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID
[2022-04-15 15:39:10,809 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 15:39:10,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 15:39:10,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID
[2022-04-15 15:39:10,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID
[2022-04-15 15:39:10,810 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:39:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:10,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563320448]
[2022-04-15 15:39:10,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563320448] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:10,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:10,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:39:10,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:10,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656780978]
[2022-04-15 15:39:10,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656780978] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:10,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:10,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:39:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092344021]
[2022-04-15 15:39:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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 23
[2022-04-15 15:39:10,811 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:10,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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:39:10,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:10,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 15:39:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 15:39:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-15 15:39:10,825 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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:39:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:11,157 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions.
[2022-04-15 15:39:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 15:39:11,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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 23
[2022-04-15 15:39:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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:39:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions.
[2022-04-15 15:39:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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:39:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions.
[2022-04-15 15:39:11,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions.
[2022-04-15 15:39:11,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:11,213 INFO L225 Difference]: With dead ends: 52
[2022-04-15 15:39:11,213 INFO L226 Difference]: Without dead ends: 50
[2022-04-15 15:39:11,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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:39:11,214 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:11,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 15:39:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2022-04-15 15:39:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42.
[2022-04-15 15:39:11,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:11,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:11,228 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:11,229 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:11,232 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions.
[2022-04-15 15:39:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions.
[2022-04-15 15:39:11,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:11,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:11,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states.
[2022-04-15 15:39:11,234 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states.
[2022-04-15 15:39:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:11,237 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions.
[2022-04-15 15:39:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions.
[2022-04-15 15:39:11,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:11,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:11,238 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:11,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8)
[2022-04-15 15:39:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions.
[2022-04-15 15:39:11,239 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23
[2022-04-15 15:39:11,240 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:11,240 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions.
[2022-04-15 15:39:11,240 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 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:39:11,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions.
[2022-04-15 15:39:11,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions.
[2022-04-15 15:39:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2022-04-15 15:39:11,290 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:11,290 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 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:39:11,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-15 15:39:11,291 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times
[2022-04-15 15:39:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:11,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1041578925]
[2022-04-15 15:39:11,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times
[2022-04-15 15:39:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307318816]
[2022-04-15 15:39:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:11,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:39:11,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117666954]
[2022-04-15 15:39:11,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:39:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:39:11,313 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:39:11,313 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:39:11,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 15:39:11,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:39:11,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 15:39:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:11,358 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:39:11,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID
[2022-04-15 15:39:11,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID
[2022-04-15 15:39:11,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:39:11,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:39:11,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:39:11,444 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1227#true} is VALID
[2022-04-15 15:39:11,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID
[2022-04-15 15:39:11,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID
[2022-04-15 15:39:11,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID
[2022-04-15 15:39:11,456 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:39:11,457 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1227#true} is VALID
[2022-04-15 15:39:11,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID
[2022-04-15 15:39:11,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID
[2022-04-15 15:39:11,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID
[2022-04-15 15:39:11,458 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID
[2022-04-15 15:39:11,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 15:39:11,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 15:39:11,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID
[2022-04-15 15:39:11,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID
[2022-04-15 15:39:11,459 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:39:11,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:39:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307318816]
[2022-04-15 15:39:11,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:39:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117666954]
[2022-04-15 15:39:11,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117666954] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:11,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:11,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:39:11,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1041578925]
[2022-04-15 15:39:11,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1041578925] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:11,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:11,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:39:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897046948]
[2022-04-15 15:39:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:11,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28
[2022-04-15 15:39:11,461 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:11,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:39:11,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:11,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 15:39:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 15:39:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:39:11,477 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:39:13,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []
[2022-04-15 15:39:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:13,840 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions.
[2022-04-15 15:39:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 15:39:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28
[2022-04-15 15:39:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:39:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions.
[2022-04-15 15:39:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:39:13,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions.
[2022-04-15 15:39:13,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions.
[2022-04-15 15:39:13,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:13,910 INFO L225 Difference]: With dead ends: 59
[2022-04-15 15:39:13,910 INFO L226 Difference]: Without dead ends: 56
[2022-04-15 15:39:13,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:39:13,911 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:13,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time]
[2022-04-15 15:39:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2022-04-15 15:39:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2022-04-15 15:39:13,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:13,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:13,939 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:13,940 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:13,941 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions.
[2022-04-15 15:39:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions.
[2022-04-15 15:39:13,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:13,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:13,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states.
[2022-04-15 15:39:13,942 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states.
[2022-04-15 15:39:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:13,944 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions.
[2022-04-15 15:39:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions.
[2022-04-15 15:39:13,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:13,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:13,944 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:13,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions.
[2022-04-15 15:39:13,946 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28
[2022-04-15 15:39:13,946 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:13,946 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions.
[2022-04-15 15:39:13,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:39:13,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions.
[2022-04-15 15:39:14,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions.
[2022-04-15 15:39:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-15 15:39:14,010 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:14,010 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, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:39:14,027 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:39:14,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:14,211 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times
[2022-04-15 15:39:14,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:14,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024781579]
[2022-04-15 15:39:14,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times
[2022-04-15 15:39:14,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:14,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190130756]
[2022-04-15 15:39:14,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:14,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:39:14,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961975516]
[2022-04-15 15:39:14,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:39:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:39:14,223 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:39:14,224 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:39:14,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 15:39:14,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:39:14,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 15:39:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:14,278 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:39:14,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID
[2022-04-15 15:39:14,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#(<= ~counter~0 0)} {1659#true} #96#return; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#(<= ~counter~0 0)} call #t~ret8 := main(); {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {1667#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#(<= ~counter~0 0)} ~cond := #in~cond; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#(<= ~counter~0 0)} assume !(0 == ~cond); {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1667#(<= ~counter~0 0)} {1667#(<= ~counter~0 0)} #80#return; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1667#(<= ~counter~0 0)} is VALID
[2022-04-15 15:39:14,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,474 INFO L272 TraceCheckUtils]: 14: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,476 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #82#return; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,477 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #84#return; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,478 INFO L272 TraceCheckUtils]: 24: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,479 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #86#return; {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1701#(<= ~counter~0 1)} is VALID
[2022-04-15 15:39:14,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1756#(<= |main_#t~post7| 1)} is VALID
[2022-04-15 15:39:14,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {1756#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1660#false} is VALID
[2022-04-15 15:39:14,481 INFO L272 TraceCheckUtils]: 32: Hoare triple {1660#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1660#false} is VALID
[2022-04-15 15:39:14,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID
[2022-04-15 15:39:14,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID
[2022-04-15 15:39:14,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {1660#false} assume !false; {1660#false} is VALID
[2022-04-15 15:39:14,481 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:39:14,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:39:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190130756]
[2022-04-15 15:39:14,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:39:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961975516]
[2022-04-15 15:39:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961975516] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:14,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:14,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:39:14,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024781579]
[2022-04-15 15:39:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024781579] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:39:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181545177]
[2022-04-15 15:39:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:14,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36
[2022-04-15 15:39:14,482 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:14,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2022-04-15 15:39:14,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:14,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 15:39:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:14,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 15:39:14,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2022-04-15 15:39:14,505 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2022-04-15 15:39:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:14,678 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions.
[2022-04-15 15:39:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 15:39:14,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36
[2022-04-15 15:39:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2022-04-15 15:39:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 15:39:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2022-04-15 15:39:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions.
[2022-04-15 15:39:14,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions.
[2022-04-15 15:39:14,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:14,736 INFO L225 Difference]: With dead ends: 76
[2022-04-15 15:39:14,736 INFO L226 Difference]: Without dead ends: 69
[2022-04-15 15:39:14,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:39:14,737 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:14,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 15:39:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2022-04-15 15:39:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68.
[2022-04-15 15:39:14,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:14,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:14,777 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:14,777 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:14,779 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions.
[2022-04-15 15:39:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions.
[2022-04-15 15:39:14,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:14,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:14,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states.
[2022-04-15 15:39:14,779 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states.
[2022-04-15 15:39:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:14,781 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions.
[2022-04-15 15:39:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions.
[2022-04-15 15:39:14,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:14,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:14,782 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:14,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2022-04-15 15:39:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions.
[2022-04-15 15:39:14,784 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36
[2022-04-15 15:39:14,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:14,785 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions.
[2022-04-15 15:39:14,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2022-04-15 15:39:14,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 79 transitions.
[2022-04-15 15:39:14,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions.
[2022-04-15 15:39:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2022-04-15 15:39:14,859 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:14,859 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, 1, 1, 1, 1, 1, 1]
[2022-04-15 15:39:14,879 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:39:15,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:15,075 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:15,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times
[2022-04-15 15:39:15,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:15,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848352507]
[2022-04-15 15:39:15,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 15:39:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times
[2022-04-15 15:39:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:15,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054106715]
[2022-04-15 15:39:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:15,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:39:15,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153251266]
[2022-04-15 15:39:15,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 15:39:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:39:15,089 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:39:15,123 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:39:15,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 15:39:15,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 15:39:15,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core
[2022-04-15 15:39:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:15,154 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:39:15,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID
[2022-04-15 15:39:15,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2197#true} is VALID
[2022-04-15 15:39:15,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID
[2022-04-15 15:39:15,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #96#return; {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret8 := main(); {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {2197#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {2197#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID
[2022-04-15 15:39:15,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2197#true} #80#return; {2197#true} is VALID
[2022-04-15 15:39:15,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {2197#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:39:15,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:39:15,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 5);havoc #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:39:15,660 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2197#true} is VALID
[2022-04-15 15:39:15,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID
[2022-04-15 15:39:15,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID
[2022-04-15 15:39:15,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {2197#true} assume true; {2197#true} is VALID
[2022-04-15 15:39:15,663 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:39:15,663 INFO L272 TraceCheckUtils]: 19: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2197#true} is VALID
[2022-04-15 15:39:15,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID
[2022-04-15 15:39:15,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID
[2022-04-15 15:39:15,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#true} assume true; {2197#true} is VALID
[2022-04-15 15:39:15,664 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:39:15,664 INFO L272 TraceCheckUtils]: 24: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2197#true} is VALID
[2022-04-15 15:39:15,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID
[2022-04-15 15:39:15,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID
[2022-04-15 15:39:15,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID
[2022-04-15 15:39:15,664 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID
[2022-04-15 15:39:15,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:15,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:15,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:15,669 INFO L272 TraceCheckUtils]: 32: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 15:39:15,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 15:39:15,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2198#false} is VALID
[2022-04-15 15:39:15,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume !false; {2198#false} is VALID
[2022-04-15 15:39:15,670 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:39:15,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:39:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054106715]
[2022-04-15 15:39:15,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:39:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153251266]
[2022-04-15 15:39:15,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153251266] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:15,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:39:15,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848352507]
[2022-04-15 15:39:15,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848352507] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:15,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 15:39:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359386754]
[2022-04-15 15:39:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:15,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36
[2022-04-15 15:39:15,672 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:15,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 15:39:15,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:15,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 15:39:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:15,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 15:39:15,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-04-15 15:39:15,697 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 15:39:17,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-15 15:39:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:18,467 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions.
[2022-04-15 15:39:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-15 15:39:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36
[2022-04-15 15:39:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 15:39:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 15:39:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions.
[2022-04-15 15:39:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 15:39:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions.
[2022-04-15 15:39:18,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions.
[2022-04-15 15:39:18,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:18,549 INFO L225 Difference]: With dead ends: 82
[2022-04-15 15:39:18,550 INFO L226 Difference]: Without dead ends: 79
[2022-04-15 15:39:18,550 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2022-04-15 15:39:18,550 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2022-04-15 15:39:18,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time]
[2022-04-15 15:39:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2022-04-15 15:39:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78.
[2022-04-15 15:39:18,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 15:39:18,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16)
[2022-04-15 15:39:18,591 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16)
[2022-04-15 15:39:18,592 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16)
[2022-04-15 15:39:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:18,593 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions.
[2022-04-15 15:39:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions.
[2022-04-15 15:39:18,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:18,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:18,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states.
[2022-04-15 15:39:18,594 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states.
[2022-04-15 15:39:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 15:39:18,596 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions.
[2022-04-15 15:39:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions.
[2022-04-15 15:39:18,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 15:39:18,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 15:39:18,596 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 15:39:18,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 15:39:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16)
[2022-04-15 15:39:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions.
[2022-04-15 15:39:18,598 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36
[2022-04-15 15:39:18,599 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 15:39:18,599 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions.
[2022-04-15 15:39:18,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2022-04-15 15:39:18,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 93 transitions.
[2022-04-15 15:39:18,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 15:39:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions.
[2022-04-15 15:39:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2022-04-15 15:39:18,700 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 15:39:18,700 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 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:39:18,716 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:39:18,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:18,910 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 15:39:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 15:39:18,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times
[2022-04-15 15:39:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 15:39:18,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [816534760]
[2022-04-15 15:39:20,383 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE
[2022-04-15 15:39:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1945491848, now seen corresponding path program 1 times
[2022-04-15 15:39:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 15:39:20,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363289731]
[2022-04-15 15:39:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 15:39:20,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 15:39:20,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256861562]
[2022-04-15 15:39:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 15:39:20,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:20,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 15:39:20,404 INFO L229 MonitoredProcess]: Starting monitored process 6 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:39:20,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2022-04-15 15:39:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:20,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-15 15:39:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 15:39:20,473 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 15:39:20,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID
[2022-04-15 15:39:20,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret8 := main(); {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {2792#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#true} assume true; {2792#true} is VALID
[2022-04-15 15:39:20,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2792#true} {2792#true} #80#return; {2792#true} is VALID
[2022-04-15 15:39:20,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:20,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [100] L35-3-->L35-1_primed: Formula: (or (let ((.cse0 (mod v_main_~r~0_In_1 4294967296)) (.cse1 (mod (div (- v_main_~d~0_Out_2) (- 2)) 4294967296))) (and (= (mod v_main_~q~0_In_1 4294967296) 0) (< v_~counter~0_Out_2 6) (= 0 (mod v_main_~p~0_Out_2 2)) (= (mod v_main_~d~0_Out_2 2) 0) (= v_main_~r~0_In_1 0) (= 0 |v_main_#t~post6_Out_2|) (= .cse0 (mod v_main_~A~0_In_1 4294967296)) (= v_main_~p~0_Out_2 0) (= v_main_~p~0_Out_2 v_main_~p~0_In_1) (<= .cse1 .cse0) (= v_main_~A~0_In_1 0) (= (mod (* v_main_~B~0_In_1 (div (- v_main_~p~0_Out_2) (- 2))) 4294967296) .cse1) (= v_main_~B~0_In_1 0))) (and (= v_main_~A~0_In_1 v_main_~A~0_In_1) (= 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))) InVars {main_~q~0=v_main_~q~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_~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, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[~counter~0, main_~d~0, main_~p~0, main_#t~post6] {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:20,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [99] L35-1_primed-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:20,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 5);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:20,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:20,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 5);havoc #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID
[2022-04-15 15:39:20,565 INFO L272 TraceCheckUtils]: 17: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2849#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 15:39:20,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {2849#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2853#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 15:39:20,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {2853#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID
[2022-04-15 15:39:20,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {2793#false} assume !false; {2793#false} is VALID
[2022-04-15 15:39:20,566 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:39:20,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 15:39:20,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 15:39:20,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363289731]
[2022-04-15 15:39:20,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 15:39:20,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256861562]
[2022-04-15 15:39:20,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256861562] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:20,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:20,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 15:39:23,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 15:39:23,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [816534760]
[2022-04-15 15:39:23,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [816534760] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 15:39:23,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 15:39:23,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2022-04-15 15:39:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613679283]
[2022-04-15 15:39:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 15:39:23,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38
[2022-04-15 15:39:23,695 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 15:39:23,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2022-04-15 15:39:25,754 WARN L143 InductivityCheck]: Transition 2866#(and (<= (mod (div (- main_~d~0) (- 2)) 4294967296) (mod main_~r~0 4294967296)) (< ~counter~0 6) (= (mod (div (- main_~d~0) (- 2)) 4294967296) (mod (* main_~B~0 (div (- main_~p~0) (- 2))) 4294967296)) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0)) ( _ , #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; , 2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0)) ) not inductive
[2022-04-15 15:39:25,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2022-04-15 15:39:25,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 15:39:25,955 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:39:25,958 INFO L158 Benchmark]: Toolchain (without parser) took 17860.74ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 135.1MB in the beginning and 151.1MB in the end (delta: -16.0MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB.
[2022-04-15 15:39:25,958 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 15:39:25,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.57ms. Allocated memory is still 184.5MB. Free memory was 134.8MB in the beginning and 159.1MB in the end (delta: -24.3MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB.
[2022-04-15 15:39:25,958 INFO L158 Benchmark]: Boogie Preprocessor took 47.23ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-15 15:39:25,958 INFO L158 Benchmark]: RCFGBuilder took 298.83ms. Allocated memory is still 184.5MB. Free memory was 157.5MB in the beginning and 146.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 15:39:25,958 INFO L158 Benchmark]: TraceAbstraction took 17280.04ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 145.5MB in the beginning and 151.1MB in the end (delta: -5.6MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB.
[2022-04-15 15:39:25,959 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.11ms. Allocated memory is still 184.5MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 229.57ms. Allocated memory is still 184.5MB. Free memory was 134.8MB in the beginning and 159.1MB in the end (delta: -24.3MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 47.23ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 157.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 298.83ms. Allocated memory is still 184.5MB. Free memory was 157.5MB in the beginning and 146.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 17280.04ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 145.5MB in the beginning and 151.1MB in the end (delta: -5.6MB). Peak memory consumption was 61.5MB. 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:39:25,984 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...