/usr/bin/java -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_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 21:32:45,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 21:32:45,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 21:32:45,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 21:32:45,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 21:32:45,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 21:32:45,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 21:32:45,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 21:32:45,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 21:32:45,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 21:32:45,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 21:32:45,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 21:32:45,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 21:32:45,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 21:32:45,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 21:32:45,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 21:32:45,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 21:32:45,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 21:32:45,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 21:32:45,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 21:32:45,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 21:32:45,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 21:32:45,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 21:32:45,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 21:32:45,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 21:32:45,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 21:32:45,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 21:32:45,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 21:32:45,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 21:32:45,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 21:32:45,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 21:32:45,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 21:32:45,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 21:32:45,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 21:32:45,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 21:32:45,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 21:32:45,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 21:32:45,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 21:32:45,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 21:32:45,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 21:32:45,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 21:32:45,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 21:32:45,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 21:32:45,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 21:32:45,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 21:32:45,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 21:32:45,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 21:32:45,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 21:32:45,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 21:32:45,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 21:32:45,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 21:32:45,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 21:32:45,400 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 21:32:45,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 21:32:45,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 21:32:45,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 21:32:45,400 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 21:32:45,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 21:32:45,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 21:32:45,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 21:32:45,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 21:32:45,401 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 21:32:45,401 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 21:32:45,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 21:32:45,401 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 21:32:45,401 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-03-20 21:32:45,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 21:32:45,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 21:32:45,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 21:32:45,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 21:32:45,608 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 21:32:45,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-03-20 21:32:45,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17abe2318/ff280ca1a0cb4bbda3aede13994b193c/FLAG4716e6436 [2022-03-20 21:32:46,008 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 21:32:46,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound1.c [2022-03-20 21:32:46,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17abe2318/ff280ca1a0cb4bbda3aede13994b193c/FLAG4716e6436 [2022-03-20 21:32:46,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17abe2318/ff280ca1a0cb4bbda3aede13994b193c [2022-03-20 21:32:46,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 21:32:46,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 21:32:46,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 21:32:46,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 21:32:46,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 21:32:46,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eaa4d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46, skipping insertion in model container [2022-03-20 21:32:46,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 21:32:46,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 21:32:46,249 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_unwindbound1.c[537,550] [2022-03-20 21:32:46,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 21:32:46,282 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 21:32:46,295 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_unwindbound1.c[537,550] [2022-03-20 21:32:46,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 21:32:46,322 INFO L208 MainTranslator]: Completed translation [2022-03-20 21:32:46,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46 WrapperNode [2022-03-20 21:32:46,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 21:32:46,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 21:32:46,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 21:32:46,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 21:32:46,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 21:32:46,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 21:32:46,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 21:32:46,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 21:32:46,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (1/1) ... [2022-03-20 21:32:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 21:32:46,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:32:46,393 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-03-20 21:32:46,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-03-20 21:32:46,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 21:32:46,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 21:32:46,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 21:32:46,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 21:32:46,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 21:32:46,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 21:32:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 21:32:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 21:32:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 21:32:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 21:32:46,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 21:32:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 21:32:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 21:32:46,442 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 21:32:46,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 21:32:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 21:32:46,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 21:32:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 21:32:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 21:32:46,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 21:32:46,502 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 21:32:46,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 21:32:46,686 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 21:32:46,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 21:32:46,691 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-20 21:32:46,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:32:46 BoogieIcfgContainer [2022-03-20 21:32:46,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 21:32:46,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 21:32:46,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 21:32:46,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 21:32:46,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 09:32:46" (1/3) ... [2022-03-20 21:32:46,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d5779e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 09:32:46, skipping insertion in model container [2022-03-20 21:32:46,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 09:32:46" (2/3) ... [2022-03-20 21:32:46,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d5779e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 09:32:46, skipping insertion in model container [2022-03-20 21:32:46,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 09:32:46" (3/3) ... [2022-03-20 21:32:46,708 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound1.c [2022-03-20 21:32:46,712 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 21:32:46,713 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 21:32:46,745 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 21:32:46,750 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-03-20 21:32:46,750 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 21:32:46,762 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-03-20 21:32:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 21:32:46,768 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:46,768 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 21:32:46,769 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:46,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-03-20 21:32:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:46,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [606809734] [2022-03-20 21:32:46,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:32:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-03-20 21:32:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:46,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83092372] [2022-03-20 21:32:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 21:32:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 21:32:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 21:32:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:46,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83092372] [2022-03-20 21:32:46,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83092372] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:46,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:46,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 21:32:47,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:47,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [606809734] [2022-03-20 21:32:47,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [606809734] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:47,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:47,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 21:32:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23113762] [2022-03-20 21:32:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:47,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 21:32:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 21:32:47,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 21:32:47,033 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-03-20 21:32:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:32:47,146 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-03-20 21:32:47,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 21:32:47,149 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-03-20 21:32:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:32:47,158 INFO L225 Difference]: With dead ends: 66 [2022-03-20 21:32:47,158 INFO L226 Difference]: Without dead ends: 33 [2022-03-20 21:32:47,161 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-03-20 21:32:47,164 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 21:32:47,166 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.1s Time] [2022-03-20 21:32:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-03-20 21:32:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-03-20 21:32:47,203 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-03-20 21:32:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-03-20 21:32:47,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-03-20 21:32:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:32:47,207 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-03-20 21:32:47,208 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-03-20 21:32:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-03-20 21:32:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 21:32:47,209 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:47,209 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 21:32:47,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 21:32:47,210 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:47,211 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-03-20 21:32:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:47,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118159638] [2022-03-20 21:32:47,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:32:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-03-20 21:32:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:47,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207077061] [2022-03-20 21:32:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:47,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 21:32:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 21:32:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 21:32:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:47,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207077061] [2022-03-20 21:32:47,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207077061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:47,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:47,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 21:32:47,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:47,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118159638] [2022-03-20 21:32:47,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118159638] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:47,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:47,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 21:32:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327847157] [2022-03-20 21:32:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:47,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 21:32:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 21:32:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 21:32:47,366 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-03-20 21:32:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:32:47,547 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-03-20 21:32:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 21:32:47,550 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-03-20 21:32:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:32:47,551 INFO L225 Difference]: With dead ends: 47 [2022-03-20 21:32:47,551 INFO L226 Difference]: Without dead ends: 45 [2022-03-20 21:32:47,551 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-20 21:32:47,553 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 21:32:47,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 96 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 21:32:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-20 21:32:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-03-20 21:32:47,561 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-03-20 21:32:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-03-20 21:32:47,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-03-20 21:32:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:32:47,562 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-03-20 21:32:47,562 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-03-20 21:32:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-03-20 21:32:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 21:32:47,566 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:47,566 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-03-20 21:32:47,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 21:32:47,567 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-03-20 21:32:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:47,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127929754] [2022-03-20 21:32:47,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:32:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-03-20 21:32:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:47,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568793878] [2022-03-20 21:32:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:47,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:32:47,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143538922] [2022-03-20 21:32:47,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 21:32:47,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:32:47,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:32:47,584 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-03-20 21:32:47,588 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-03-20 21:32:47,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-20 21:32:47,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 21:32:47,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 21:32:47,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:32:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 21:32:47,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:32:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:47,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568793878] [2022-03-20 21:32:47,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:32:47,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143538922] [2022-03-20 21:32:47,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143538922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:47,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:47,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 21:32:47,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:47,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127929754] [2022-03-20 21:32:47,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127929754] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:47,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:47,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 21:32:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373014445] [2022-03-20 21:32:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:47,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 21:32:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 21:32:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 21:32:47,718 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-03-20 21:32:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:32:47,731 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-03-20 21:32:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 21:32:47,731 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-03-20 21:32:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:32:47,732 INFO L225 Difference]: With dead ends: 52 [2022-03-20 21:32:47,732 INFO L226 Difference]: Without dead ends: 38 [2022-03-20 21:32:47,733 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-03-20 21:32:47,734 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-03-20 21:32:47,734 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-03-20 21:32:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-20 21:32:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-03-20 21:32:47,742 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-03-20 21:32:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-03-20 21:32:47,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-03-20 21:32:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:32:47,743 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-03-20 21:32:47,743 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-03-20 21:32:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-03-20 21:32:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 21:32:47,744 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:47,744 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-03-20 21:32:47,770 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-03-20 21:32:47,959 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-03-20 21:32:47,960 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-03-20 21:32:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:47,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926223536] [2022-03-20 21:32:47,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:32:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-03-20 21:32:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:47,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408373933] [2022-03-20 21:32:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 21:32:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 21:32:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 21:32:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 21:32:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:48,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408373933] [2022-03-20 21:32:48,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408373933] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:48,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:48,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 21:32:48,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:48,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926223536] [2022-03-20 21:32:48,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926223536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:48,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:48,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 21:32:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253160340] [2022-03-20 21:32:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:48,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 21:32:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 21:32:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 21:32:48,098 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-03-20 21:32:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:32:48,241 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-03-20 21:32:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 21:32:48,241 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-03-20 21:32:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:32:48,242 INFO L225 Difference]: With dead ends: 52 [2022-03-20 21:32:48,242 INFO L226 Difference]: Without dead ends: 50 [2022-03-20 21:32:48,243 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-03-20 21:32:48,244 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 21:32:48,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 21:32:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-03-20 21:32:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-03-20 21:32:48,254 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-03-20 21:32:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-03-20 21:32:48,255 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-03-20 21:32:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:32:48,255 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-03-20 21:32:48,255 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-03-20 21:32:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-03-20 21:32:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-20 21:32:48,256 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:48,256 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-03-20 21:32:48,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 21:32:48,257 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:48,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-03-20 21:32:48,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:48,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465491332] [2022-03-20 21:32:48,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:32:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-03-20 21:32:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989507126] [2022-03-20 21:32:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:48,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:32:48,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595208379] [2022-03-20 21:32:48,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 21:32:48,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:32:48,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:32:48,270 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-03-20 21:32:48,279 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-03-20 21:32:48,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 21:32:48,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 21:32:48,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 21:32:48,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:32:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 21:32:48,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:32:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:48,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989507126] [2022-03-20 21:32:48,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:32:48,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595208379] [2022-03-20 21:32:48,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595208379] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:48,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:48,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:32:48,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:48,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465491332] [2022-03-20 21:32:48,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465491332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:48,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:48,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:32:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092041729] [2022-03-20 21:32:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:48,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 21:32:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 21:32:48,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-20 21:32:48,462 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-03-20 21:32:50,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 21:32:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:32:50,689 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-03-20 21:32:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 21:32:50,690 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-03-20 21:32:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:32:50,691 INFO L225 Difference]: With dead ends: 59 [2022-03-20 21:32:50,691 INFO L226 Difference]: Without dead ends: 56 [2022-03-20 21:32:50,691 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-03-20 21:32:50,692 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-20 21:32:50,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 151 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-03-20 21:32:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-20 21:32:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-03-20 21:32:50,701 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-03-20 21:32:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-03-20 21:32:50,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-03-20 21:32:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:32:50,703 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-03-20 21:32:50,703 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-03-20 21:32:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-03-20 21:32:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-20 21:32:50,709 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:50,709 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-03-20 21:32:50,737 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-03-20 21:32:50,923 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-03-20 21:32:50,924 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-03-20 21:32:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658202971] [2022-03-20 21:32:50,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:32:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-03-20 21:32:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748813760] [2022-03-20 21:32:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:50,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:32:50,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208671568] [2022-03-20 21:32:50,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 21:32:50,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:32:50,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:32:50,943 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-03-20 21:32:50,945 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-03-20 21:32:50,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 21:32:50,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 21:32:50,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 21:32:50,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:32:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-03-20 21:32:51,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:32:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:51,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748813760] [2022-03-20 21:32:51,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:32:51,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208671568] [2022-03-20 21:32:51,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208671568] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:51,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:51,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 21:32:51,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:51,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658202971] [2022-03-20 21:32:51,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658202971] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:51,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:51,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 21:32:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018434112] [2022-03-20 21:32:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:51,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 21:32:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 21:32:51,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-20 21:32:51,218 INFO L87 Difference]: Start difference. First operand 56 states and 71 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-03-20 21:32:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:32:51,352 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-03-20 21:32:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 21:32:51,357 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-03-20 21:32:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:32:51,358 INFO L225 Difference]: With dead ends: 77 [2022-03-20 21:32:51,358 INFO L226 Difference]: Without dead ends: 74 [2022-03-20 21:32:51,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-03-20 21:32:51,359 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 21:32:51,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 166 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 21:32:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-20 21:32:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-03-20 21:32:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.25) internal successors, (50), 42 states have internal predecessors, (50), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-03-20 21:32:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-03-20 21:32:51,373 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 36 [2022-03-20 21:32:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:32:51,373 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-03-20 21:32:51,373 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-03-20 21:32:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-03-20 21:32:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 21:32:51,375 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:32:51,375 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 21:32:51,400 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-03-20 21:32:51,595 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-03-20 21:32:51,596 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:32:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:32:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-03-20 21:32:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:51,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208332518] [2022-03-20 21:32:52,335 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 21:32:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash 119537629, now seen corresponding path program 1 times [2022-03-20 21:32:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:32:52,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144683610] [2022-03-20 21:32:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:32:52,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:32:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780054046] [2022-03-20 21:32:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:32:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:32:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:32:52,352 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-03-20 21:32:52,355 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-03-20 21:32:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:32:52,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 21:32:52,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:32:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 21:32:52,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:32:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:32:52,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144683610] [2022-03-20 21:32:52,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:32:52,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780054046] [2022-03-20 21:32:52,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780054046] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:52,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:52,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:32:55,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:32:55,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208332518] [2022-03-20 21:32:55,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208332518] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:32:55,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:32:55,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-20 21:32:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300716394] [2022-03-20 21:32:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:32:55,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 21:32:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:32:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 21:32:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=349, Unknown=1, NotChecked=0, Total=420 [2022-03-20 21:32:55,147 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 20 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 13 states have internal predecessors, (28), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 21:32:57,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:32:59,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:33:03,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:33:05,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:33:08,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 21:33:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:33:08,369 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-03-20 21:33:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 21:33:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 13 states have internal predecessors, (28), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2022-03-20 21:33:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:33:08,371 INFO L225 Difference]: With dead ends: 105 [2022-03-20 21:33:08,372 INFO L226 Difference]: Without dead ends: 80 [2022-03-20 21:33:08,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=99, Invalid=499, Unknown=2, NotChecked=0, Total=600 [2022-03-20 21:33:08,374 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-03-20 21:33:08,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 340 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 5 Unknown, 0 Unchecked, 10.9s Time] [2022-03-20 21:33:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-20 21:33:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-03-20 21:33:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 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-03-20 21:33:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2022-03-20 21:33:08,394 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 43 [2022-03-20 21:33:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:33:08,394 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2022-03-20 21:33:08,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 13 states have internal predecessors, (28), 6 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 21:33:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-03-20 21:33:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 21:33:08,395 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:33:08,395 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 21:33:08,420 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-03-20 21:33:08,596 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-03-20 21:33:08,596 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:33:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:33:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-03-20 21:33:08,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:33:08,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665700665] [2022-03-20 21:34:28,338 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 21:34:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash -210838127, now seen corresponding path program 1 times [2022-03-20 21:34:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:34:28,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324913921] [2022-03-20 21:34:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:34:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:34:28,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:34:28,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217667899] [2022-03-20 21:34:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:34:28,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:34:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:34:28,355 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-03-20 21:34:28,356 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-03-20 21:34:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:34:28,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 21:34:28,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:34:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 21:34:28,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:34:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:34:28,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324913921] [2022-03-20 21:34:28,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:34:28,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217667899] [2022-03-20 21:34:28,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217667899] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:34:28,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:34:28,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 21:34:32,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:34:32,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1665700665] [2022-03-20 21:34:32,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1665700665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:34:32,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:34:32,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-03-20 21:34:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260687200] [2022-03-20 21:34:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:34:32,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 21:34:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:34:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 21:34:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=458, Unknown=1, NotChecked=0, Total=552 [2022-03-20 21:34:32,044 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 23 states, 20 states have (on average 1.35) internal successors, (27), 15 states have internal predecessors, (27), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-03-20 21:34:34,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:34:41,192 WARN L232 SmtUtils]: Spent 6.81s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 21:34:43,655 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-03-20 21:34:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:34:45,304 INFO L93 Difference]: Finished difference Result 104 states and 132 transitions. [2022-03-20 21:34:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-20 21:34:45,305 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.35) internal successors, (27), 15 states have internal predecessors, (27), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2022-03-20 21:34:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:34:45,306 INFO L225 Difference]: With dead ends: 104 [2022-03-20 21:34:45,306 INFO L226 Difference]: Without dead ends: 100 [2022-03-20 21:34:45,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=134, Invalid=735, Unknown=1, NotChecked=0, Total=870 [2022-03-20 21:34:45,307 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-03-20 21:34:45,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 510 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 437 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-03-20 21:34:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-03-20 21:34:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2022-03-20 21:34:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 60 states have internal predecessors, (68), 23 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-03-20 21:34:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-03-20 21:34:45,324 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 46 [2022-03-20 21:34:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:34:45,324 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-03-20 21:34:45,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.35) internal successors, (27), 15 states have internal predecessors, (27), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-03-20 21:34:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-03-20 21:34:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 21:34:45,326 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:34:45,326 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2022-03-20 21:34:45,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-20 21:34:45,548 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-03-20 21:34:45,548 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:34:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:34:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-03-20 21:34:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:34:45,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849801641] [2022-03-20 21:34:45,549 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 21:34:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 2 times [2022-03-20 21:34:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:34:45,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762567986] [2022-03-20 21:34:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:34:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:34:45,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:34:45,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961433489] [2022-03-20 21:34:45,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 21:34:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:34:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:34:45,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 21:34:45,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 21:34:45,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 21:34:45,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 21:34:45,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 21:34:45,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:34:45,756 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-20 21:34:45,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:34:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:34:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762567986] [2022-03-20 21:34:45,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:34:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961433489] [2022-03-20 21:34:45,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961433489] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:34:45,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:34:45,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:34:45,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:34:45,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849801641] [2022-03-20 21:34:45,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849801641] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:34:45,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:34:45,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:34:45,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450565070] [2022-03-20 21:34:45,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:34:45,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 21:34:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:34:45,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 21:34:45,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 21:34:45,759 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-03-20 21:34:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:34:45,800 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-03-20 21:34:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 21:34:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 50 [2022-03-20 21:34:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:34:45,801 INFO L225 Difference]: With dead ends: 110 [2022-03-20 21:34:45,801 INFO L226 Difference]: Without dead ends: 68 [2022-03-20 21:34:45,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-20 21:34:45,802 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 21:34:45,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 21:34:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-20 21:34:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-03-20 21:34:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.069767441860465) internal successors, (46), 44 states have internal predecessors, (46), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 21:34:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-03-20 21:34:45,819 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 50 [2022-03-20 21:34:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:34:45,819 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-03-20 21:34:45,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-03-20 21:34:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-03-20 21:34:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 21:34:45,821 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:34:45,821 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 21:34:45,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 21:34:46,021 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:34:46,022 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:34:46,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:34:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 2 times [2022-03-20 21:34:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:34:46,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774498605] [2022-03-20 21:34:58,867 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 21:34:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1218658397, now seen corresponding path program 1 times [2022-03-20 21:34:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:34:58,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469514586] [2022-03-20 21:34:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:34:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:34:58,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:34:58,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009632804] [2022-03-20 21:34:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:34:58,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:34:58,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:34:58,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 21:34:58,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 21:34:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:34:58,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 21:34:58,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:34:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 21:34:58,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:34:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:34:58,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469514586] [2022-03-20 21:34:59,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:34:59,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009632804] [2022-03-20 21:34:59,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009632804] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:34:59,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:34:59,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:35:29,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:35:29,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774498605] [2022-03-20 21:35:29,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774498605] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:35:29,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:35:29,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-20 21:35:29,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655261560] [2022-03-20 21:35:29,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:35:29,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-20 21:35:29,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:35:29,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-20 21:35:29,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=549, Unknown=11, NotChecked=0, Total=650 [2022-03-20 21:35:29,168 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 25 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 17 states have internal predecessors, (34), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-20 21:35:31,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:35:32,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:35:33,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:35:35,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:35:37,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:35:59,072 WARN L232 SmtUtils]: Spent 21.60s on a formula simplification. DAG size of input: 43 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 21:36:05,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:07,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:09,620 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:11,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:13,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:15,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:17,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:19,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:21,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:28,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:30,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:38,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:36:40,529 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-03-20 21:36:42,539 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-03-20 21:36:44,550 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-03-20 21:36:46,559 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-03-20 21:36:48,573 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-03-20 21:36:50,582 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-03-20 21:36:52,592 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-03-20 21:36:54,602 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-03-20 21:36:56,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:37:00,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:37:02,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 21:37:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:37:14,308 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-03-20 21:37:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-20 21:37:14,309 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 17 states have internal predecessors, (34), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Word has length 61 [2022-03-20 21:37:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:37:14,309 INFO L225 Difference]: With dead ends: 88 [2022-03-20 21:37:14,309 INFO L226 Difference]: Without dead ends: 72 [2022-03-20 21:37:14,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 80.1s TimeCoverageRelationStatistics Valid=146, Invalid=954, Unknown=22, NotChecked=0, Total=1122 [2022-03-20 21:37:14,310 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 31 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.9s IncrementalHoareTripleChecker+Time [2022-03-20 21:37:14,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 170 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 379 Invalid, 23 Unknown, 0 Unchecked, 54.9s Time] [2022-03-20 21:37:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-20 21:37:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-03-20 21:37:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-20 21:37:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-03-20 21:37:14,325 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 61 [2022-03-20 21:37:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:37:14,325 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-03-20 21:37:14,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 17 states have internal predecessors, (34), 7 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-03-20 21:37:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-03-20 21:37:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 21:37:14,326 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 21:37:14,326 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 21:37:14,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-20 21:37:14,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:37:14,539 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 21:37:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 21:37:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1995039641, now seen corresponding path program 2 times [2022-03-20 21:37:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 21:37:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112652489] [2022-03-20 21:39:45,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-03-20 21:39:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1134703343, now seen corresponding path program 1 times [2022-03-20 21:39:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 21:39:45,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958727348] [2022-03-20 21:39:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:39:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 21:39:45,351 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 21:39:45,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670393681] [2022-03-20 21:39:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 21:39:45,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 21:39:45,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 21:39:45,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 21:39:45,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 21:39:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 21:39:45,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 21:39:45,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 21:39:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 21:39:45,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 21:39:45,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 21:39:45,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958727348] [2022-03-20 21:39:45,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 21:39:45,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670393681] [2022-03-20 21:39:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670393681] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:39:45,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:39:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 21:40:12,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 21:40:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112652489] [2022-03-20 21:40:12,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112652489] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 21:40:12,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 21:40:12,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-20 21:40:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761944912] [2022-03-20 21:40:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 21:40:12,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-20 21:40:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 21:40:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-20 21:40:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=536, Unknown=12, NotChecked=0, Total=650 [2022-03-20 21:40:12,942 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 25 states, 22 states have (on average 1.5) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-03-20 21:40:36,410 WARN L232 SmtUtils]: Spent 21.81s on a formula simplification. DAG size of input: 42 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 21:40:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 21:40:36,862 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-03-20 21:40:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 21:40:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.5) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 64 [2022-03-20 21:40:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 21:40:36,862 INFO L225 Difference]: With dead ends: 70 [2022-03-20 21:40:36,862 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 21:40:36,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=130, Invalid=728, Unknown=12, NotChecked=0, Total=870 [2022-03-20 21:40:36,864 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-20 21:40:36,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 177 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-20 21:40:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 21:40:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 21:40:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 21:40:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 21:40:36,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-03-20 21:40:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 21:40:36,869 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 21:40:36,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.5) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-03-20 21:40:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 21:40:36,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 21:40:36,872 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 21:40:36,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-20 21:40:37,072 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-20 21:40:37,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 21:41:04,325 WARN L232 SmtUtils]: Spent 26.69s on a formula simplification. DAG size of input: 61 DAG size of output: 54 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 21:41:05,149 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-03-20 21:41:05,149 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-03-20 21:41:05,149 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-03-20 21:41:05,150 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-03-20 21:41:05,150 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (or (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-03-20 21:41:05,150 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-03-20 21:41:05,150 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (<= 0 ~counter~0)) (not (<= ~counter~0 0))) [2022-03-20 21:41:05,150 INFO L878 garLoopResultBuilder]: At program point L35-3(lines 35 43) the Hoare annotation is: (let ((.cse1 (= main_~A~0 main_~r~0)) (.cse2 (<= 1 (mod main_~B~0 4294967296))) (.cse3 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (mod (div main_~d~0 2) 4294967296))) (and (<= .cse0 (mod main_~r~0 4294967296)) .cse1 (<= ~counter~0 1) (<= 1 ~counter~0) (= (mod (div (- main_~d~0) (- 2)) 4294967296) (mod (* main_~B~0 (div (- main_~p~0) (- 2))) 4294967296)) .cse2 (= (mod main_~d~0 2) 0) .cse3 (= (mod main_~p~0 2) 0) (= .cse0 (mod (* main_~B~0 (div main_~p~0 2)) 4294967296)) (= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296)))) (not (<= 0 |old(~counter~0)|)) (and .cse1 (<= 0 ~counter~0) (<= ~counter~0 0) .cse2 .cse3 (= main_~B~0 main_~d~0) (= main_~p~0 1)))) [2022-03-20 21:41:05,150 INFO L885 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: true [2022-03-20 21:41:05,150 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 23 62) the Hoare annotation is: true [2022-03-20 21:41:05,150 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 23 62) the Hoare annotation is: true [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L38(lines 35 43) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 23 62) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (or (and (<= 0 ~counter~0) (<= ~counter~0 0) (<= 1 (mod main_~B~0 4294967296))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,151 INFO L878 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L53(lines 53 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L53-2(lines 23 62) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L47(lines 45 57) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 57) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (<= 1 |main_#t~post7|) (<= 1 ~counter~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 45 57) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (<= ~counter~0 1) (<= 1 ~counter~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= main_~p~0 1)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 35 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (<= 1 ~counter~0) (<= |main_#t~post6| 0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~B~0 main_~d~0) (= ~counter~0 (+ |main_#t~post6| 1)) (= main_~p~0 1)) (not (<= 0 |old(~counter~0)|))) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 21:41:05,152 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-03-20 21:41:05,153 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 21:41:05,153 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-03-20 21:41:05,153 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 21:41:05,153 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 21:41:05,153 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-03-20 21:41:05,153 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (let ((.cse0 (not (= |__VERIFIER_assert_#in~cond| 1))) (.cse1 (not (<= 1 ~counter~0))) (.cse2 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (.cse3 (not (<= ~counter~0 1)))) (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (not (= (mod main_~r~0 4294967296) (mod main_~A~0 4294967296))) .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not (= (mod main_~q~0 4294967296) 0)) .cse3) (or .cse0 .cse1 .cse2 (not (= main_~B~0 main_~d~0)) .cse3 (not (= main_~p~0 1)) (not (<= 1 (mod main_~B~0 4294967296)))))) [2022-03-20 21:41:05,153 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-03-20 21:41:05,153 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse0 (not (= |__VERIFIER_assert_#in~cond| 1))) (.cse1 (not (<= 1 ~counter~0))) (.cse2 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (.cse3 (not (<= ~counter~0 1)))) (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (not (= (mod main_~r~0 4294967296) (mod main_~A~0 4294967296))) .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not (= (mod main_~q~0 4294967296) 0)) .cse3) (or .cse0 .cse1 .cse2 (not (= main_~B~0 main_~d~0)) .cse3 (not (= main_~p~0 1)) (not (<= 1 (mod main_~B~0 4294967296)))))) [2022-03-20 21:41:05,153 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (let ((.cse0 (not (= |__VERIFIER_assert_#in~cond| 1))) (.cse1 (not (<= 1 ~counter~0))) (.cse2 (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (.cse3 (not (<= ~counter~0 1)))) (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (not (= (mod main_~r~0 4294967296) (mod main_~A~0 4294967296))) .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (not (= (mod main_~q~0 4294967296) 0)) .cse3) (or .cse0 .cse1 .cse2 (not (= main_~B~0 main_~d~0)) .cse3 (not (= main_~p~0 1)) (not (<= 1 (mod main_~B~0 4294967296)))))) [2022-03-20 21:41:05,153 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-03-20 21:41:05,156 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-03-20 21:41:05,157 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 21:41:05,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 09:41:05 BoogieIcfgContainer [2022-03-20 21:41:05,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 21:41:05,181 INFO L158 Benchmark]: Toolchain (without parser) took 499154.65ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 133.5MB in the beginning and 96.1MB in the end (delta: 37.4MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2022-03-20 21:41:05,181 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 183.5MB. Free memory was 150.3MB in the beginning and 150.2MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 21:41:05,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.14ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 133.3MB in the beginning and 196.3MB in the end (delta: -63.1MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-03-20 21:41:05,181 INFO L158 Benchmark]: Boogie Preprocessor took 38.45ms. Allocated memory is still 220.2MB. Free memory was 196.3MB in the beginning and 194.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 21:41:05,182 INFO L158 Benchmark]: RCFGBuilder took 337.66ms. Allocated memory is still 220.2MB. Free memory was 194.8MB in the beginning and 183.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 21:41:05,182 INFO L158 Benchmark]: TraceAbstraction took 498478.23ms. Allocated memory is still 220.2MB. Free memory was 183.3MB in the beginning and 96.1MB in the end (delta: 87.1MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. [2022-03-20 21:41:05,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 183.5MB. Free memory was 150.3MB in the beginning and 150.2MB in the end (delta: 72.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.14ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 133.3MB in the beginning and 196.3MB in the end (delta: -63.1MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.45ms. Allocated memory is still 220.2MB. Free memory was 196.3MB in the beginning and 194.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 337.66ms. Allocated memory is still 220.2MB. Free memory was 194.8MB in the beginning and 183.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 498478.23ms. Allocated memory is still 220.2MB. Free memory was 183.3MB in the beginning and 96.1MB in the end (delta: 87.1MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 498.4s, OverallIterations: 11, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 158.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 76.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 1922 SdHoareTripleChecker+Invalid, 75.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1521 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1724 IncrementalHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 401 mSDtfsCounter, 1724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 286 SyntacticMatches, 23 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 144.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=8, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 307 PreInvPairs, 378 NumberOfFragments, 820 HoareAnnotationTreeSize, 307 FomulaSimplifications, 300 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 37 FomulaSimplificationsInter, 1156 FormulaSimplificationTreeSizeReductionInter, 28.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || ((((((((((d / 2 % 4294967296 <= r % 4294967296 && A == r) && counter <= 1) && 1 <= counter) && -d / -2 % 4294967296 == B * (-p / -2) % 4294967296) && 1 <= B % 4294967296) && d % 2 == 0) && q == 0) && p % 2 == 0) && d / 2 % 4294967296 == B * (p / 2) % 4294967296) && d % 4294967296 == B * p % 4294967296)) || !(0 <= \old(counter))) || ((((((A == r && 0 <= counter) && counter <= 0) && 1 <= B % 4294967296) && q == 0) && B == d) && p == 1) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: ((!(\old(cond) == 0) && cond == \old(cond)) || !(0 <= counter)) || !(counter <= 0) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (((!(1 <= \old(cond)) || 1 <= cond) && ((((!(r % 4294967296 == A % 4294967296) || !(\old(cond) == 1)) || !(1 <= counter)) || \old(cond) == cond) || !(counter <= 1))) && ((((!(\old(cond) == 1) || !(1 <= counter)) || \old(cond) == cond) || !(q % 4294967296 == 0)) || !(counter <= 1))) && ((((((!(\old(cond) == 1) || !(1 <= counter)) || \old(cond) == cond) || !(B == d)) || !(counter <= 1)) || !(p == 1)) || !(1 <= B % 4294967296)) RESULT: Ultimate proved your program to be correct! [2022-03-20 21:41:05,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...