/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/xcsp/AllInterval-005.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:50:09,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:50:09,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:50:09,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:50:09,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:50:09,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:50:09,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:50:09,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:50:09,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:50:09,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:50:09,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:50:09,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:50:09,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:50:09,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:50:09,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:50:09,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:50:09,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:50:09,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:50:09,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:50:09,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:50:09,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:50:09,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:50:09,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:50:09,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:50:09,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:50:09,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:50:09,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:50:09,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:50:09,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:50:09,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:50:09,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:50:09,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:50:09,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:50:09,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:50:09,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:50:09,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:50:09,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:50:09,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:50:09,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:50:09,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:50:09,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:50:09,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:50:09,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:50:09,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:50:09,763 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:50:09,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:50:09,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:50:09,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:50:09,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:50:09,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:50:09,764 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:50:09,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:50:09,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:50:09,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:50:09,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:50:09,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:50:09,767 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:50:09,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:50:09,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:50:09,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-01-10 01:50:09,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:50:09,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:50:09,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:50:09,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:50:09,987 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:50:09,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/xcsp/AllInterval-005.c [2022-01-10 01:50:10,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe49e67/85e0fd2193f947c98945532e03efa79d/FLAGe78d0d1e9 [2022-01-10 01:50:10,348 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:50:10,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-005.c [2022-01-10 01:50:10,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe49e67/85e0fd2193f947c98945532e03efa79d/FLAGe78d0d1e9 [2022-01-10 01:50:10,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe49e67/85e0fd2193f947c98945532e03efa79d [2022-01-10 01:50:10,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:50:10,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:50:10,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:50:10,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:50:10,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:50:10,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:10,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c95dabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10, skipping insertion in model container [2022-01-10 01:50:10,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:10,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:50:10,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:50:10,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-005.c[2566,2579] [2022-01-10 01:50:10,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:50:10,955 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:50:10,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/xcsp/AllInterval-005.c[2566,2579] [2022-01-10 01:50:10,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:50:10,997 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:50:10,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10 WrapperNode [2022-01-10 01:50:10,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:50:10,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:50:11,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:50:11,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:50:11,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,041 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-01-10 01:50:11,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:50:11,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:50:11,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:50:11,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:50:11,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:50:11,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:50:11,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:50:11,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:50:11,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (1/1) ... [2022-01-10 01:50:11,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:50:11,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:11,112 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-01-10 01:50:11,126 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-01-10 01:50:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:50:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:50:11,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:50:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:50:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2022-01-10 01:50:11,156 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2022-01-10 01:50:11,202 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:50:11,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:50:11,336 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:50:11,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:50:11,340 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 01:50:11,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:50:11 BoogieIcfgContainer [2022-01-10 01:50:11,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:50:11,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:50:11,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:50:11,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:50:11,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:50:10" (1/3) ... [2022-01-10 01:50:11,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcbfbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:50:11, skipping insertion in model container [2022-01-10 01:50:11,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:10" (2/3) ... [2022-01-10 01:50:11,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bcbfbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:50:11, skipping insertion in model container [2022-01-10 01:50:11,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:50:11" (3/3) ... [2022-01-10 01:50:11,346 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2022-01-10 01:50:11,349 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:50:11,350 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:50:11,383 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:50:11,387 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-01-10 01:50:11,387 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:50:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-10 01:50:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 01:50:11,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:11,414 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:11,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:11,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:11,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2022-01-10 01:50:11,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:11,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063869450] [2022-01-10 01:50:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:11,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:50:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:50:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:50:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:50:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:50:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:50:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:50:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:50:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:50:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:50:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:50:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:50:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:50:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:50:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:50:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:50:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:50:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 01:50:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:50:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:50:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:50:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 01:50:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-01-10 01:50:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-10 01:50:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-01-10 01:50:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-10 01:50:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:50:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:50:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:50:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:50:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:50:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:50:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-01-10 01:50:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:50:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-01-10 01:50:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2022-01-10 01:50:11,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:11,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063869450] [2022-01-10 01:50:11,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063869450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:11,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:50:11,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 01:50:11,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086493269] [2022-01-10 01:50:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:11,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 01:50:11,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 01:50:11,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:50:11,707 INFO L87 Difference]: Start difference. First operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2022-01-10 01:50:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:11,751 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2022-01-10 01:50:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 01:50:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 214 [2022-01-10 01:50:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:11,769 INFO L225 Difference]: With dead ends: 134 [2022-01-10 01:50:11,769 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 01:50:11,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:50:11,773 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:11,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 01:50:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-10 01:50:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-01-10 01:50:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2022-01-10 01:50:11,812 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2022-01-10 01:50:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:11,813 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2022-01-10 01:50:11,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2022-01-10 01:50:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2022-01-10 01:50:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 01:50:11,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:11,823 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:11,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:50:11,824 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:11,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:11,824 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2022-01-10 01:50:11,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:11,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758274058] [2022-01-10 01:50:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:11,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:50:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:50:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:50:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:50:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:50:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:50:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:50:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:50:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:50:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:50:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:50:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:50:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:50:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:50:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:50:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:50:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:50:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 01:50:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:50:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:50:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:50:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 01:50:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-01-10 01:50:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-10 01:50:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-01-10 01:50:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-10 01:50:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:50:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:50:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:50:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:50:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:50:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:50:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-01-10 01:50:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:50:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-01-10 01:50:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 432 proven. 351 refuted. 0 times theorem prover too weak. 2029 trivial. 0 not checked. [2022-01-10 01:50:13,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758274058] [2022-01-10 01:50:13,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758274058] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48891645] [2022-01-10 01:50:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:13,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:13,003 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-01-10 01:50:13,048 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-01-10 01:50:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:13,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-10 01:50:13,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-01-10 01:50:14,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 534 proven. 357 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-01-10 01:50:16,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48891645] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:16,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:16,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 61 [2022-01-10 01:50:16,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531194944] [2022-01-10 01:50:16,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:16,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-10 01:50:16,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-10 01:50:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3388, Unknown=0, NotChecked=0, Total=3660 [2022-01-10 01:50:16,077 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) [2022-01-10 01:50:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:19,264 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2022-01-10 01:50:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-10 01:50:19,265 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) Word has length 214 [2022-01-10 01:50:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:19,272 INFO L225 Difference]: With dead ends: 117 [2022-01-10 01:50:19,272 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 01:50:19,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1427, Invalid=6229, Unknown=0, NotChecked=0, Total=7656 [2022-01-10 01:50:19,275 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 401 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:19,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 1845 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 01:50:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 01:50:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2022-01-10 01:50:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-01-10 01:50:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2022-01-10 01:50:19,299 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2022-01-10 01:50:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:19,300 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2022-01-10 01:50:19,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 47 states have internal predecessors, (68), 35 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 31 states have call predecessors, (100), 35 states have call successors, (100) [2022-01-10 01:50:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2022-01-10 01:50:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 01:50:19,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:19,303 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:19,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:19,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:19,521 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2022-01-10 01:50:19,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:19,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166868597] [2022-01-10 01:50:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:19,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:50:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:50:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:50:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-10 01:50:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-10 01:50:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:50:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:50:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:50:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:50:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-10 01:50:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:50:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 01:50:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 01:50:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-01-10 01:50:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 01:50:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-01-10 01:50:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 01:50:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 01:50:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-01-10 01:50:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:50:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:50:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 01:50:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-01-10 01:50:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-10 01:50:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-01-10 01:50:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-10 01:50:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:50:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:50:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:50:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:50:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:50:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:50:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-01-10 01:50:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:50:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-01-10 01:50:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 573 proven. 318 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-01-10 01:50:20,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:20,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166868597] [2022-01-10 01:50:20,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166868597] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:20,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413810523] [2022-01-10 01:50:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:20,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:20,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:20,635 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-01-10 01:50:20,702 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-01-10 01:50:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:20,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-10 01:50:20,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 724 proven. 282 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2022-01-10 01:50:24,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 576 proven. 315 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2022-01-10 01:50:27,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413810523] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:27,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:27,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 58 [2022-01-10 01:50:27,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326791996] [2022-01-10 01:50:27,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:27,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-10 01:50:27,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-10 01:50:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3034, Unknown=1, NotChecked=0, Total=3306 [2022-01-10 01:50:27,256 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) [2022-01-10 01:50:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:33,178 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2022-01-10 01:50:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-10 01:50:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) Word has length 214 [2022-01-10 01:50:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:33,180 INFO L225 Difference]: With dead ends: 113 [2022-01-10 01:50:33,180 INFO L226 Difference]: Without dead ends: 101 [2022-01-10 01:50:33,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1462, Invalid=6019, Unknown=1, NotChecked=0, Total=7482 [2022-01-10 01:50:33,182 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 314 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:33,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1694 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1590 Invalid, 0 Unknown, 119 Unchecked, 1.2s Time] [2022-01-10 01:50:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-10 01:50:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2022-01-10 01:50:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-01-10 01:50:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2022-01-10 01:50:33,193 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2022-01-10 01:50:33,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:33,193 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2022-01-10 01:50:33,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 39 states have internal predecessors, (68), 36 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (106), 32 states have call predecessors, (106), 36 states have call successors, (106) [2022-01-10 01:50:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2022-01-10 01:50:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 01:50:33,205 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:33,205 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:33,224 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-01-10 01:50:33,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-10 01:50:33,422 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:33,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2022-01-10 01:50:33,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:33,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672651283] [2022-01-10 01:50:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:33,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:50:33,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 01:50:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 01:50:33,633 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 01:50:33,633 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 01:50:33,635 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:50:33,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 01:50:33,638 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-01-10 01:50:33,640 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:50:33,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:50:33 BoogieIcfgContainer [2022-01-10 01:50:33,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:50:33,710 INFO L158 Benchmark]: Toolchain (without parser) took 22932.57ms. Allocated memory was 190.8MB in the beginning and 431.0MB in the end (delta: 240.1MB). Free memory was 140.9MB in the beginning and 379.5MB in the end (delta: -238.5MB). Peak memory consumption was 225.5MB. Max. memory is 8.0GB. [2022-01-10 01:50:33,710 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:50:33,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.46ms. Allocated memory was 190.8MB in the beginning and 248.5MB in the end (delta: 57.7MB). Free memory was 140.7MB in the beginning and 225.5MB in the end (delta: -84.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-01-10 01:50:33,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.64ms. Allocated memory is still 248.5MB. Free memory was 225.5MB in the beginning and 224.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 01:50:33,711 INFO L158 Benchmark]: Boogie Preprocessor took 28.78ms. Allocated memory is still 248.5MB. Free memory was 224.0MB in the beginning and 222.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 01:50:33,711 INFO L158 Benchmark]: RCFGBuilder took 269.93ms. Allocated memory is still 248.5MB. Free memory was 222.4MB in the beginning and 209.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 01:50:33,712 INFO L158 Benchmark]: TraceAbstraction took 22366.71ms. Allocated memory was 248.5MB in the beginning and 431.0MB in the end (delta: 182.5MB). Free memory was 209.8MB in the beginning and 379.5MB in the end (delta: -169.6MB). Peak memory consumption was 237.2MB. Max. memory is 8.0GB. [2022-01-10 01:50:33,716 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 190.8MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.46ms. Allocated memory was 190.8MB in the beginning and 248.5MB in the end (delta: 57.7MB). Free memory was 140.7MB in the beginning and 225.5MB in the end (delta: -84.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.64ms. Allocated memory is still 248.5MB. Free memory was 225.5MB in the beginning and 224.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.78ms. Allocated memory is still 248.5MB. Free memory was 224.0MB in the beginning and 222.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 269.93ms. Allocated memory is still 248.5MB. Free memory was 222.4MB in the beginning and 209.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22366.71ms. Allocated memory was 248.5MB in the beginning and 431.0MB in the end (delta: 182.5MB). Free memory was 209.8MB in the beginning and 379.5MB in the end (delta: -169.6MB). Peak memory consumption was 237.2MB. 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: 93]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 4) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 4) VAL [dummy=0, var0=3, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=1, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var5 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=2, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=4, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=3, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 723 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 3646 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 119 IncrementalHoareTripleChecker+Unchecked, 3404 mSDsCounter, 821 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 821 mSolverCounterUnsat, 242 mSDtfsCounter, 3546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1243 GetRequests, 1071 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 74, 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, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 3 QuantifiedInterpolants, 10227 SizeOfPredicates, 67 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17704/19684 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-01-10 01:50:33,740 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...