/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 22:04:03,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 22:04:03,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 22:04:03,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 22:04:03,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 22:04:03,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 22:04:03,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 22:04:03,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 22:04:03,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 22:04:03,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 22:04:03,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 22:04:03,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 22:04:03,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 22:04:03,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 22:04:03,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 22:04:03,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 22:04:03,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 22:04:03,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 22:04:03,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 22:04:03,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 22:04:03,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 22:04:03,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 22:04:03,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 22:04:03,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 22:04:03,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 22:04:03,200 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 22:04:03,200 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 22:04:03,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 22:04:03,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 22:04:03,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 22:04:03,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 22:04:03,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 22:04:03,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 22:04:03,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 22:04:03,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 22:04:03,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 22:04:03,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 22:04:03,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 22:04:03,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 22:04:03,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 22:04:03,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 22:04:03,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 22:04:03,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 22:04:03,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 22:04:03,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 22:04:03,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 22:04:03,219 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 22:04:03,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 22:04:03,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 22:04:03,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 22:04:03,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 22:04:03,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 22:04:03,220 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 22:04:03,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 22:04:03,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 22:04:03,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 22:04:03,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 22:04:03,220 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 22:04:03,221 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02-14 22:04:03,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 22:04:03,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 22:04:03,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 22:04:03,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 22:04:03,438 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 22:04:03,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-02-14 22:04:03,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73035dfec/457937fce1b34a26866b898c114ac3ee/FLAG0f1cd3f53 [2022-02-14 22:04:03,847 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 22:04:03,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound10.c [2022-02-14 22:04:03,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73035dfec/457937fce1b34a26866b898c114ac3ee/FLAG0f1cd3f53 [2022-02-14 22:04:03,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73035dfec/457937fce1b34a26866b898c114ac3ee [2022-02-14 22:04:03,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 22:04:03,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 22:04:03,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 22:04:03,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 22:04:03,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 22:04:03,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:04:03" (1/1) ... [2022-02-14 22:04:03,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5246ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:03, skipping insertion in model container [2022-02-14 22:04:03,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:04:03" (1/1) ... [2022-02-14 22:04:03,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 22:04:03,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 22:04:04,046 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/cohencu-ll_unwindbound10.c[588,601] [2022-02-14 22:04:04,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 22:04:04,086 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 22:04:04,096 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/cohencu-ll_unwindbound10.c[588,601] [2022-02-14 22:04:04,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 22:04:04,112 INFO L208 MainTranslator]: Completed translation [2022-02-14 22:04:04,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04 WrapperNode [2022-02-14 22:04:04,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 22:04:04,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 22:04:04,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 22:04:04,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 22:04:04,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 22:04:04,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 22:04:04,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 22:04:04,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 22:04:04,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 22:04:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:04,184 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-02-14 22:04:04,206 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-02-14 22:04:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 22:04:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 22:04:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 22:04:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-14 22:04:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 22:04:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 22:04:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 22:04:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 22:04:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 22:04:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 22:04:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-02-14 22:04:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 22:04:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 22:04:04,258 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 22:04:04,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 22:04:04,413 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 22:04:04,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 22:04:04,417 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-14 22:04:04,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:04:04 BoogieIcfgContainer [2022-02-14 22:04:04,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 22:04:04,419 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 22:04:04,419 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 22:04:04,420 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 22:04:04,422 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:04:04" (1/1) ... [2022-02-14 22:04:04,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 10:04:04 BasicIcfg [2022-02-14 22:04:04,434 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 22:04:04,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 22:04:04,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 22:04:04,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 22:04:04,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:04:03" (1/4) ... [2022-02-14 22:04:04,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e3c3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:04:04, skipping insertion in model container [2022-02-14 22:04:04,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:04:04" (2/4) ... [2022-02-14 22:04:04,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e3c3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:04:04, skipping insertion in model container [2022-02-14 22:04:04,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:04:04" (3/4) ... [2022-02-14 22:04:04,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e3c3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:04:04, skipping insertion in model container [2022-02-14 22:04:04,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 10:04:04" (4/4) ... [2022-02-14 22:04:04,465 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound10.cJordan [2022-02-14 22:04:04,468 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 22:04:04,469 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 22:04:04,515 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 22:04:04,519 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 22:04:04,519 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 22:04:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-14 22:04:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-14 22:04:04,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:04,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:04,534 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:04,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1427487266, now seen corresponding path program 1 times [2022-02-14 22:04:04,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:04,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482930194] [2022-02-14 22:04:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 22:04:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 22:04:04,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:04,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482930194] [2022-02-14 22:04:04,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482930194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 22:04:04,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 22:04:04,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 22:04:04,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644242442] [2022-02-14 22:04:04,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 22:04:04,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 22:04:04,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:04,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 22:04:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 22:04:04,736 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 22:04:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:04,829 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-14 22:04:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 22:04:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-14 22:04:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:04,836 INFO L225 Difference]: With dead ends: 32 [2022-02-14 22:04:04,836 INFO L226 Difference]: Without dead ends: 27 [2022-02-14 22:04:04,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 22:04:04,841 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:04,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-14 22:04:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-02-14 22:04:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-14 22:04:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-02-14 22:04:04,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-02-14 22:04:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:04,866 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-02-14 22:04:04,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 22:04:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-02-14 22:04:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-14 22:04:04,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:04,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:04,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 22:04:04,868 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:04,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1331862890, now seen corresponding path program 1 times [2022-02-14 22:04:04,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:04,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127532754] [2022-02-14 22:04:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 22:04:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 22:04:04,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:04,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127532754] [2022-02-14 22:04:04,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127532754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 22:04:04,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 22:04:04,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 22:04:04,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767891818] [2022-02-14 22:04:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 22:04:04,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 22:04:04,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:04,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 22:04:04,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 22:04:04,942 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 22:04:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:05,016 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-02-14 22:04:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 22:04:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-14 22:04:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:05,017 INFO L225 Difference]: With dead ends: 28 [2022-02-14 22:04:05,017 INFO L226 Difference]: Without dead ends: 28 [2022-02-14 22:04:05,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 22:04:05,018 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:05,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-14 22:04:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-14 22:04:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-14 22:04:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-02-14 22:04:05,024 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-02-14 22:04:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:05,024 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-02-14 22:04:05,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 22:04:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-02-14 22:04:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-14 22:04:05,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:05,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:05,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 22:04:05,040 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:05,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1332935366, now seen corresponding path program 1 times [2022-02-14 22:04:05,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:05,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407798010] [2022-02-14 22:04:05,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 22:04:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 22:04:05,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:05,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407798010] [2022-02-14 22:04:05,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407798010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 22:04:05,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 22:04:05,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 22:04:05,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563770131] [2022-02-14 22:04:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 22:04:05,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 22:04:05,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 22:04:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 22:04:05,155 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 22:04:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:05,269 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-14 22:04:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 22:04:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-14 22:04:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:05,270 INFO L225 Difference]: With dead ends: 32 [2022-02-14 22:04:05,270 INFO L226 Difference]: Without dead ends: 32 [2022-02-14 22:04:05,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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-02-14 22:04:05,271 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:05,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-14 22:04:05,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-14 22:04:05,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-14 22:04:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-02-14 22:04:05,277 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-02-14 22:04:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:05,278 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-02-14 22:04:05,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 22:04:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-02-14 22:04:05,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 22:04:05,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:05,278 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:05,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-14 22:04:05,279 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:05,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1273314772, now seen corresponding path program 1 times [2022-02-14 22:04:05,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:05,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29113107] [2022-02-14 22:04:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:05,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:05,288 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:05,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182018382] [2022-02-14 22:04:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:05,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:05,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:05,296 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-02-14 22:04:05,297 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-02-14 22:04:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:05,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 22:04:05,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 22:04:05,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 22:04:05,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:05,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29113107] [2022-02-14 22:04:05,430 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:05,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182018382] [2022-02-14 22:04:05,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182018382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 22:04:05,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 22:04:05,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 22:04:05,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97847065] [2022-02-14 22:04:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 22:04:05,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 22:04:05,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 22:04:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 22:04:05,432 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 22:04:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:05,479 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-02-14 22:04:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 22:04:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-14 22:04:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:05,480 INFO L225 Difference]: With dead ends: 48 [2022-02-14 22:04:05,480 INFO L226 Difference]: Without dead ends: 48 [2022-02-14 22:04:05,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-02-14 22:04:05,481 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:05,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 153 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 22:04:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-14 22:04:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-02-14 22:04:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-14 22:04:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-02-14 22:04:05,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-02-14 22:04:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:05,487 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-02-14 22:04:05,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-14 22:04:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-14 22:04:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-14 22:04:05,488 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:05,488 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:05,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-14 22:04:05,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:05,692 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1649805282, now seen corresponding path program 1 times [2022-02-14 22:04:05,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:05,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596979410] [2022-02-14 22:04:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:05,700 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:05,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363221472] [2022-02-14 22:04:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:05,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:05,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:05,708 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-02-14 22:04:05,714 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-02-14 22:04:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:05,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 22:04:05,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-14 22:04:05,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 22:04:05,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:05,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596979410] [2022-02-14 22:04:05,858 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:05,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363221472] [2022-02-14 22:04:05,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363221472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 22:04:05,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 22:04:05,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 22:04:05,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618268964] [2022-02-14 22:04:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 22:04:05,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 22:04:05,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 22:04:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 22:04:05,860 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 22:04:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:05,900 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-02-14 22:04:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 22:04:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-02-14 22:04:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:05,901 INFO L225 Difference]: With dead ends: 52 [2022-02-14 22:04:05,901 INFO L226 Difference]: Without dead ends: 52 [2022-02-14 22:04:05,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-14 22:04:05,902 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:05,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 150 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 22:04:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-14 22:04:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-02-14 22:04:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-14 22:04:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-02-14 22:04:05,908 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-02-14 22:04:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:05,908 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-02-14 22:04:05,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 22:04:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-02-14 22:04:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-14 22:04:05,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:05,909 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:05,934 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-02-14 22:04:06,114 WARN L452 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-02-14 22:04:06,115 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1442767915, now seen corresponding path program 1 times [2022-02-14 22:04:06,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:06,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013219401] [2022-02-14 22:04:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:06,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:06,124 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:06,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460066509] [2022-02-14 22:04:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:06,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:06,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:06,132 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-02-14 22:04:06,132 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-02-14 22:04:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:06,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 22:04:06,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-14 22:04:06,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 22:04:06,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:06,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013219401] [2022-02-14 22:04:06,286 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:06,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460066509] [2022-02-14 22:04:06,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460066509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 22:04:06,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 22:04:06,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-14 22:04:06,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433240770] [2022-02-14 22:04:06,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 22:04:06,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-14 22:04:06,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:06,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-14 22:04:06,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-14 22:04:06,287 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-02-14 22:04:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:06,333 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-02-14 22:04:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 22:04:06,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 27 [2022-02-14 22:04:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:06,334 INFO L225 Difference]: With dead ends: 60 [2022-02-14 22:04:06,334 INFO L226 Difference]: Without dead ends: 50 [2022-02-14 22:04:06,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-02-14 22:04:06,335 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:06,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 151 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 22:04:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-14 22:04:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-14 22:04:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-14 22:04:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-02-14 22:04:06,348 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-02-14 22:04:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:06,349 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-02-14 22:04:06,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-02-14 22:04:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-02-14 22:04:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-14 22:04:06,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:06,350 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2022-02-14 22:04:06,371 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-02-14 22:04:06,563 WARN L452 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-02-14 22:04:06,564 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:06,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1251454759, now seen corresponding path program 1 times [2022-02-14 22:04:06,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:06,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97255865] [2022-02-14 22:04:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:06,572 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:06,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251368425] [2022-02-14 22:04:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:06,574 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-02-14 22:04:06,583 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-02-14 22:04:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:06,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 22:04:06,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-14 22:04:06,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-14 22:04:06,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:06,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97255865] [2022-02-14 22:04:06,805 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:06,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251368425] [2022-02-14 22:04:06,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251368425] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:06,805 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:06,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-14 22:04:06,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460664158] [2022-02-14 22:04:06,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:06,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 22:04:06,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:06,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 22:04:06,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-14 22:04:06,806 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-14 22:04:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:06,912 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-02-14 22:04:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 22:04:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-02-14 22:04:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:06,924 INFO L225 Difference]: With dead ends: 104 [2022-02-14 22:04:06,924 INFO L226 Difference]: Without dead ends: 104 [2022-02-14 22:04:06,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-14 22:04:06,926 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 56 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:06,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 191 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-14 22:04:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-02-14 22:04:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-14 22:04:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-02-14 22:04:06,939 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-02-14 22:04:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:06,939 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-02-14 22:04:06,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-02-14 22:04:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-02-14 22:04:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-14 22:04:06,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:06,940 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:06,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-14 22:04:07,158 WARN L452 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-02-14 22:04:07,158 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1899744846, now seen corresponding path program 1 times [2022-02-14 22:04:07,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:07,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135685160] [2022-02-14 22:04:07,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:07,166 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:07,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395923757] [2022-02-14 22:04:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:07,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:07,168 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-02-14 22:04:07,169 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-02-14 22:04:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:07,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 22:04:07,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-14 22:04:07,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-14 22:04:07,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:07,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135685160] [2022-02-14 22:04:07,435 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:07,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395923757] [2022-02-14 22:04:07,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395923757] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:07,435 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:07,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-14 22:04:07,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526504944] [2022-02-14 22:04:07,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:07,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 22:04:07,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 22:04:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-14 22:04:07,437 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-02-14 22:04:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:07,654 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-02-14 22:04:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 22:04:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-02-14 22:04:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:07,656 INFO L225 Difference]: With dead ends: 116 [2022-02-14 22:04:07,656 INFO L226 Difference]: Without dead ends: 116 [2022-02-14 22:04:07,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-14 22:04:07,656 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:07,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-14 22:04:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-14 22:04:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-14 22:04:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-14 22:04:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-02-14 22:04:07,680 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-02-14 22:04:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:07,680 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-02-14 22:04:07,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-02-14 22:04:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-02-14 22:04:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-14 22:04:07,681 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:07,682 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:07,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:07,882 WARN L452 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-02-14 22:04:07,882 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 400776220, now seen corresponding path program 2 times [2022-02-14 22:04:07,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:07,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140799072] [2022-02-14 22:04:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:07,890 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:07,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251088889] [2022-02-14 22:04:07,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 22:04:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:07,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:07,904 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-02-14 22:04:07,904 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-02-14 22:04:07,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 22:04:07,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:07,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 22:04:07,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-14 22:04:08,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-14 22:04:08,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:08,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140799072] [2022-02-14 22:04:08,146 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:08,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251088889] [2022-02-14 22:04:08,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251088889] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:08,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:08,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-14 22:04:08,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32048934] [2022-02-14 22:04:08,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:08,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 22:04:08,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:08,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 22:04:08,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-14 22:04:08,147 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-02-14 22:04:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:08,208 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-02-14 22:04:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 22:04:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-02-14 22:04:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:08,209 INFO L225 Difference]: With dead ends: 120 [2022-02-14 22:04:08,209 INFO L226 Difference]: Without dead ends: 120 [2022-02-14 22:04:08,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-14 22:04:08,210 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:08,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 263 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 22:04:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-14 22:04:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-02-14 22:04:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-02-14 22:04:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-02-14 22:04:08,216 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-02-14 22:04:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:08,217 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-02-14 22:04:08,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-02-14 22:04:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-02-14 22:04:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-14 22:04:08,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:08,218 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:08,236 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-02-14 22:04:08,432 WARN L452 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-02-14 22:04:08,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -895540175, now seen corresponding path program 3 times [2022-02-14 22:04:08,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:08,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031451084] [2022-02-14 22:04:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:08,439 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:08,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229131716] [2022-02-14 22:04:08,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 22:04:08,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:08,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:08,441 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-02-14 22:04:08,442 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-02-14 22:04:08,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-14 22:04:08,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:08,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-14 22:04:08,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-14 22:04:08,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-14 22:04:08,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:08,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031451084] [2022-02-14 22:04:08,854 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:08,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229131716] [2022-02-14 22:04:08,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229131716] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:08,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:08,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-14 22:04:08,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734928372] [2022-02-14 22:04:08,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:08,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 22:04:08,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 22:04:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-14 22:04:08,857 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-02-14 22:04:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:09,040 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2022-02-14 22:04:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 22:04:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-02-14 22:04:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:09,041 INFO L225 Difference]: With dead ends: 144 [2022-02-14 22:04:09,041 INFO L226 Difference]: Without dead ends: 135 [2022-02-14 22:04:09,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-14 22:04:09,042 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:09,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-14 22:04:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-02-14 22:04:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-14 22:04:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-02-14 22:04:09,047 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-02-14 22:04:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:09,048 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-02-14 22:04:09,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-02-14 22:04:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-02-14 22:04:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-14 22:04:09,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:09,049 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:09,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:09,264 WARN L452 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-02-14 22:04:09,265 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 999510626, now seen corresponding path program 1 times [2022-02-14 22:04:09,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:09,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252713789] [2022-02-14 22:04:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:09,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:09,272 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:09,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575648224] [2022-02-14 22:04:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:09,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:09,273 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-02-14 22:04:09,274 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-02-14 22:04:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-14 22:04:09,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-14 22:04:09,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-02-14 22:04:10,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:10,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252713789] [2022-02-14 22:04:10,165 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:10,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575648224] [2022-02-14 22:04:10,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575648224] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:10,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:10,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-02-14 22:04:10,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47456811] [2022-02-14 22:04:10,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:10,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-14 22:04:10,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:10,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-14 22:04:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-14 22:04:10,166 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-02-14 22:04:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:10,353 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-02-14 22:04:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 22:04:10,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-02-14 22:04:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:10,356 INFO L225 Difference]: With dead ends: 146 [2022-02-14 22:04:10,356 INFO L226 Difference]: Without dead ends: 144 [2022-02-14 22:04:10,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-02-14 22:04:10,357 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:10,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 225 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-14 22:04:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-02-14 22:04:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-14 22:04:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-02-14 22:04:10,365 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-02-14 22:04:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:10,365 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-02-14 22:04:10,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-02-14 22:04:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-02-14 22:04:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-14 22:04:10,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:10,366 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:10,385 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-02-14 22:04:10,566 WARN L452 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-02-14 22:04:10,567 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash -601883655, now seen corresponding path program 1 times [2022-02-14 22:04:10,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:10,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102681679] [2022-02-14 22:04:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:10,574 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:10,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069617490] [2022-02-14 22:04:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:10,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:10,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:10,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:10,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-14 22:04:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 22:04:10,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-14 22:04:10,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-14 22:04:10,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:11,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:11,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102681679] [2022-02-14 22:04:11,043 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:11,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069617490] [2022-02-14 22:04:11,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069617490] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 22:04:11,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 22:04:11,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-02-14 22:04:11,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870287259] [2022-02-14 22:04:11,044 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:11,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 22:04:11,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 22:04:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-14 22:04:11,045 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-14 22:04:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:11,113 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-02-14 22:04:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 22:04:11,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-02-14 22:04:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:11,116 INFO L225 Difference]: With dead ends: 141 [2022-02-14 22:04:11,116 INFO L226 Difference]: Without dead ends: 132 [2022-02-14 22:04:11,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-14 22:04:11,116 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:11,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 22:04:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-14 22:04:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-02-14 22:04:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-14 22:04:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-02-14 22:04:11,123 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-02-14 22:04:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:11,123 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-02-14 22:04:11,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-02-14 22:04:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-02-14 22:04:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-14 22:04:11,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:11,127 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:11,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:11,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:11,343 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1157335722, now seen corresponding path program 4 times [2022-02-14 22:04:11,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:11,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182121875] [2022-02-14 22:04:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:11,350 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:11,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828462579] [2022-02-14 22:04:11,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 22:04:11,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:11,351 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:11,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-14 22:04:12,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 22:04:12,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:12,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-14 22:04:12,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 86 proven. 46 refuted. 4 times theorem prover too weak. 170 trivial. 0 not checked. [2022-02-14 22:04:26,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-02-14 22:04:27,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:27,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182121875] [2022-02-14 22:04:27,421 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:27,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828462579] [2022-02-14 22:04:27,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828462579] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:27,421 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:27,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-02-14 22:04:27,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287715103] [2022-02-14 22:04:27,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:27,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 22:04:27,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:27,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 22:04:27,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=5, NotChecked=0, Total=182 [2022-02-14 22:04:27,422 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-02-14 22:04:37,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:04:39,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:04:41,339 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-02-14 22:04:43,356 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-02-14 22:04:45,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:04:48,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:04:50,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:04:52,137 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-02-14 22:04:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:52,148 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-02-14 22:04:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 22:04:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) Word has length 78 [2022-02-14 22:04:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:52,150 INFO L225 Difference]: With dead ends: 141 [2022-02-14 22:04:52,150 INFO L226 Difference]: Without dead ends: 139 [2022-02-14 22:04:52,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=66, Invalid=199, Unknown=7, NotChecked=0, Total=272 [2022-02-14 22:04:52,151 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 34 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:52,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 102 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 80 Invalid, 8 Unknown, 0 Unchecked, 17.2s Time] [2022-02-14 22:04:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-14 22:04:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2022-02-14 22:04:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-02-14 22:04:52,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-02-14 22:04:52,155 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-02-14 22:04:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:52,155 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-02-14 22:04:52,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20) [2022-02-14 22:04:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-02-14 22:04:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-14 22:04:52,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:52,156 INFO L514 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:52,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:52,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-14 22:04:52,365 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash -821976909, now seen corresponding path program 2 times [2022-02-14 22:04:52,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:52,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482895832] [2022-02-14 22:04:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:52,372 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:52,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387561715] [2022-02-14 22:04:52,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 22:04:52,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:52,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:52,374 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:52,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-14 22:04:52,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 22:04:52,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:52,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-14 22:04:52,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-02-14 22:04:52,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:52,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:52,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482895832] [2022-02-14 22:04:52,841 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:52,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387561715] [2022-02-14 22:04:52,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387561715] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 22:04:52,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 22:04:52,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-02-14 22:04:52,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238453239] [2022-02-14 22:04:52,841 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:52,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 22:04:52,841 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 22:04:52,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-14 22:04:52,842 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-02-14 22:04:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:52,956 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2022-02-14 22:04:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 22:04:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-02-14 22:04:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:52,957 INFO L225 Difference]: With dead ends: 138 [2022-02-14 22:04:52,957 INFO L226 Difference]: Without dead ends: 129 [2022-02-14 22:04:52,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-14 22:04:52,958 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:52,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-14 22:04:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-02-14 22:04:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-02-14 22:04:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-02-14 22:04:52,961 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-02-14 22:04:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:52,961 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-02-14 22:04:52,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-02-14 22:04:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-02-14 22:04:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-02-14 22:04:52,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:52,962 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:52,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:53,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-14 22:04:53,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:53,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1992307858, now seen corresponding path program 2 times [2022-02-14 22:04:53,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:53,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262935052] [2022-02-14 22:04:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:53,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:53,178 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:53,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401207855] [2022-02-14 22:04:53,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 22:04:53,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:53,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:53,180 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:53,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-14 22:04:53,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 22:04:53,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:53,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-14 22:04:53,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-02-14 22:04:53,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:53,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:53,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262935052] [2022-02-14 22:04:53,874 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:53,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401207855] [2022-02-14 22:04:53,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401207855] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 22:04:53,874 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 22:04:53,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-14 22:04:53,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971510591] [2022-02-14 22:04:53,874 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:53,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-14 22:04:53,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:53,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-14 22:04:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-14 22:04:53,875 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-02-14 22:04:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:54,022 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-02-14 22:04:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 22:04:54,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-02-14 22:04:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:54,024 INFO L225 Difference]: With dead ends: 150 [2022-02-14 22:04:54,024 INFO L226 Difference]: Without dead ends: 150 [2022-02-14 22:04:54,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-14 22:04:54,024 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:54,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-14 22:04:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-02-14 22:04:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-14 22:04:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-02-14 22:04:54,028 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-02-14 22:04:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:54,028 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-02-14 22:04:54,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-02-14 22:04:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-02-14 22:04:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-14 22:04:54,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:54,029 INFO L514 BasicCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:54,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:54,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-14 22:04:54,239 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1089028459, now seen corresponding path program 2 times [2022-02-14 22:04:54,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:54,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501007449] [2022-02-14 22:04:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:54,246 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:54,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045798121] [2022-02-14 22:04:54,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 22:04:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:54,250 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:54,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-14 22:04:54,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 22:04:54,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:54,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 22:04:54,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-02-14 22:04:54,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-02-14 22:04:54,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:54,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501007449] [2022-02-14 22:04:54,682 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:54,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045798121] [2022-02-14 22:04:54,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045798121] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:54,683 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:54,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-02-14 22:04:54,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940216967] [2022-02-14 22:04:54,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:54,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 22:04:54,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 22:04:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-14 22:04:54,684 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-02-14 22:04:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:54,929 INFO L93 Difference]: Finished difference Result 355 states and 369 transitions. [2022-02-14 22:04:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-14 22:04:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-02-14 22:04:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:54,931 INFO L225 Difference]: With dead ends: 355 [2022-02-14 22:04:54,931 INFO L226 Difference]: Without dead ends: 353 [2022-02-14 22:04:54,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-02-14 22:04:54,932 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 171 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:54,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 267 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-14 22:04:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-02-14 22:04:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-02-14 22:04:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-02-14 22:04:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-02-14 22:04:54,939 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-02-14 22:04:54,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:54,939 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-02-14 22:04:54,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-02-14 22:04:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-02-14 22:04:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-02-14 22:04:54,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:54,940 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:54,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-14 22:04:55,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-14 22:04:55,141 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -925808019, now seen corresponding path program 3 times [2022-02-14 22:04:55,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:55,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085720259] [2022-02-14 22:04:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:55,147 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:55,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575557271] [2022-02-14 22:04:55,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 22:04:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:55,152 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:55,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-14 22:04:55,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-14 22:04:55,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:55,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-14 22:04:55,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-02-14 22:04:55,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:56,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:56,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085720259] [2022-02-14 22:04:56,179 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:56,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575557271] [2022-02-14 22:04:56,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575557271] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 22:04:56,179 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 22:04:56,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-02-14 22:04:56,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958395781] [2022-02-14 22:04:56,180 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:56,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-14 22:04:56,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:56,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-14 22:04:56,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-14 22:04:56,180 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-14 22:04:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:04:56,308 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-02-14 22:04:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 22:04:56,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-02-14 22:04:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:04:56,310 INFO L225 Difference]: With dead ends: 311 [2022-02-14 22:04:56,310 INFO L226 Difference]: Without dead ends: 302 [2022-02-14 22:04:56,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-14 22:04:56,311 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 22:04:56,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 372 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 22:04:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-02-14 22:04:56,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-02-14 22:04:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-02-14 22:04:56,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-02-14 22:04:56,317 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-02-14 22:04:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:04:56,317 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-02-14 22:04:56,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-02-14 22:04:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-02-14 22:04:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-02-14 22:04:56,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:04:56,318 INFO L514 BasicCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:04:56,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-14 22:04:56,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:56,519 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:04:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:04:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 386125940, now seen corresponding path program 3 times [2022-02-14 22:04:56,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:04:56,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594410846] [2022-02-14 22:04:56,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:04:56,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:04:56,525 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:04:56,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393566674] [2022-02-14 22:04:56,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 22:04:56,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:04:56,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:04:56,527 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:04:56,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-14 22:04:56,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-14 22:04:56,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:04:56,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 22:04:56,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:04:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-02-14 22:04:57,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:04:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-02-14 22:04:57,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:04:57,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594410846] [2022-02-14 22:04:57,916 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:04:57,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393566674] [2022-02-14 22:04:57,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393566674] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 22:04:57,916 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 22:04:57,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-14 22:04:57,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062589130] [2022-02-14 22:04:57,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 22:04:57,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-14 22:04:57,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:04:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-14 22:04:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-14 22:04:57,917 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-14 22:04:59,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:05:01,633 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-02-14 22:05:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:05:01,650 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-02-14 22:05:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 22:05:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-02-14 22:05:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:05:01,652 INFO L225 Difference]: With dead ends: 309 [2022-02-14 22:05:01,652 INFO L226 Difference]: Without dead ends: 309 [2022-02-14 22:05:01,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-14 22:05:01,652 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-14 22:05:01,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 240 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-02-14 22:05:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-02-14 22:05:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-02-14 22:05:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-02-14 22:05:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-02-14 22:05:01,659 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-02-14 22:05:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:05:01,659 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-02-14 22:05:01,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-02-14 22:05:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-02-14 22:05:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-14 22:05:01,660 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:05:01,660 INFO L514 BasicCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:05:01,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-14 22:05:01,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-14 22:05:01,866 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:05:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:05:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash -939165401, now seen corresponding path program 4 times [2022-02-14 22:05:01,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:05:01,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62981653] [2022-02-14 22:05:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:05:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:05:01,875 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:05:01,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1041338343] [2022-02-14 22:05:01,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-14 22:05:01,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:05:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:05:01,876 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:05:01,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-14 22:05:03,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-14 22:05:03,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 22:05:03,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-14 22:05:03,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 22:05:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 234 proven. 352 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2022-02-14 22:05:06,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 22:05:08,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 22:05:08,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62981653] [2022-02-14 22:05:08,654 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-14 22:05:08,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041338343] [2022-02-14 22:05:08,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041338343] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 22:05:08,654 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-14 22:05:08,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-14 22:05:08,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783751888] [2022-02-14 22:05:08,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-14 22:05:08,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-14 22:05:08,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 22:05:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-14 22:05:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-02-14 22:05:08,655 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-02-14 22:05:15,640 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-02-14 22:05:17,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-14 22:05:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 22:05:19,308 INFO L93 Difference]: Finished difference Result 313 states and 326 transitions. [2022-02-14 22:05:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 22:05:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 160 [2022-02-14 22:05:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 22:05:19,309 INFO L225 Difference]: With dead ends: 313 [2022-02-14 22:05:19,309 INFO L226 Difference]: Without dead ends: 297 [2022-02-14 22:05:19,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 184 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-02-14 22:05:19,310 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-02-14 22:05:19,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 143 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 122 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2022-02-14 22:05:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-02-14 22:05:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-02-14 22:05:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 189 states have (on average 1.0105820105820107) internal successors, (191), 190 states have internal predecessors, (191), 55 states have call successors, (55), 53 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-02-14 22:05:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 299 transitions. [2022-02-14 22:05:19,315 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 299 transitions. Word has length 160 [2022-02-14 22:05:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 22:05:19,315 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 299 transitions. [2022-02-14 22:05:19,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-02-14 22:05:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 299 transitions. [2022-02-14 22:05:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-02-14 22:05:19,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 22:05:19,317 INFO L514 BasicCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 22:05:19,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-02-14 22:05:19,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:05:19,523 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 22:05:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 22:05:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1419180943, now seen corresponding path program 3 times [2022-02-14 22:05:19,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 22:05:19,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594228020] [2022-02-14 22:05:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 22:05:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 22:05:19,538 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-14 22:05:19,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565220263] [2022-02-14 22:05:19,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-14 22:05:19,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:05:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 22:05:19,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 22:05:19,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-14 22:05:19,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2022-02-14 22:05:19,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-14 22:05:19,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-14 22:05:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-14 22:05:20,036 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-14 22:05:20,036 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-14 22:05:20,037 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-14 22:05:20,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-14 22:05:20,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 22:05:20,246 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-02-14 22:05:20,248 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-14 22:05:20,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:05:20 BasicIcfg [2022-02-14 22:05:20,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-14 22:05:20,309 INFO L158 Benchmark]: Toolchain (without parser) took 76435.32ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 149.1MB in the beginning and 140.3MB in the end (delta: 8.8MB). Peak memory consumption was 50.1MB. Max. memory is 8.0GB. [2022-02-14 22:05:20,310 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-14 22:05:20,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.22ms. Allocated memory is still 197.1MB. Free memory was 148.9MB in the beginning and 173.3MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-14 22:05:20,310 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 197.1MB. Free memory was 173.3MB in the beginning and 171.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-14 22:05:20,310 INFO L158 Benchmark]: RCFGBuilder took 276.02ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 161.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-14 22:05:20,310 INFO L158 Benchmark]: IcfgTransformer took 14.70ms. Allocated memory is still 197.1MB. Free memory was 161.1MB in the beginning and 159.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-14 22:05:20,310 INFO L158 Benchmark]: TraceAbstraction took 75874.54ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 159.3MB in the beginning and 140.3MB in the end (delta: 18.9MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. [2022-02-14 22:05:20,311 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.09ms. Allocated memory is still 197.1MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.22ms. Allocated memory is still 197.1MB. Free memory was 148.9MB in the beginning and 173.3MB in the end (delta: -24.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 197.1MB. Free memory was 173.3MB in the beginning and 171.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.02ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 161.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 14.70ms. Allocated memory is still 197.1MB. Free memory was 161.1MB in the beginning and 159.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 75874.54ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 159.3MB in the beginning and 140.3MB in the end (delta: 18.9MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=15, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=10, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<10 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=10, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=10, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=10, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=10, counter=11, n=10, x=1000, y=331, z=66] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.7s, OverallIterations: 20, TraceHistogramMax: 52, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 41.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 461 SdHoareTripleChecker+Valid, 31.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 3677 SdHoareTripleChecker+Invalid, 31.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2823 mSDsCounter, 491 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1923 IncrementalHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 491 mSolverCounterUnsat, 854 mSDtfsCounter, 1923 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2190 GetRequests, 1984 SyntacticMatches, 21 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=16, InterpolantAutomatonStates: 153, 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, 19 MinimizatonAttempts, 67 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1407 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1929 ConstructedInterpolants, 0 QuantifiedInterpolants, 9175 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2863 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 9706/11036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-14 22:05:20,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...