/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:18:14,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:18:14,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:18:14,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:18:14,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:18:14,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:18:14,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:18:14,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:18:14,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:18:14,560 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:18:14,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:18:14,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:18:14,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:18:14,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:18:14,563 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:18:14,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:18:14,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:18:14,564 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:18:14,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:18:14,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:18:14,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:18:14,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:18:14,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:18:14,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:18:14,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:18:14,567 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:18:14,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:18:14,567 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:18:14,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:18:14,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:18:14,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:18:14,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:18:14,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:14,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:18:14,570 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:18:14,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:18:14,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:18:14,571 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:18:14,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:18:14,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:18:14,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:18:14,850 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:18:14,851 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:18:14,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2023-12-16 04:18:15,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:18:16,213 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:18:16,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2023-12-16 04:18:16,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5739d8b92/8460fc41ea1744e39d8a090ff9d365f9/FLAG1278a21a4 [2023-12-16 04:18:16,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5739d8b92/8460fc41ea1744e39d8a090ff9d365f9 [2023-12-16 04:18:16,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:18:16,245 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:18:16,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:16,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:18:16,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:18:16,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3fa6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16, skipping insertion in model container [2023-12-16 04:18:16,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,285 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:18:16,415 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i[915,928] [2023-12-16 04:18:16,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:16,496 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:18:16,505 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i[915,928] [2023-12-16 04:18:16,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:18:16,561 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:18:16,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16 WrapperNode [2023-12-16 04:18:16,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:18:16,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:16,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:18:16,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:18:16,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,636 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2023-12-16 04:18:16,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:18:16,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:18:16,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:18:16,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:18:16,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,693 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2023-12-16 04:18:16,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:18:16,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:18:16,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:18:16,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:18:16,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (1/1) ... [2023-12-16 04:18:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:18:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:16,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:18:16,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:18:16,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:18:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:18:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:18:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:18:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:18:16,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:18:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:18:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:18:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:18:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:18:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:18:16,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:18:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:18:16,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:18:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:18:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:18:16,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:18:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:18:16,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:18:16,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:18:16,967 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:18:16,969 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:18:17,476 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:18:17,512 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:18:17,512 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:18:17,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:17 BoogieIcfgContainer [2023-12-16 04:18:17,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:18:17,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:18:17,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:18:17,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:18:17,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:18:16" (1/3) ... [2023-12-16 04:18:17,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3decb0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:17, skipping insertion in model container [2023-12-16 04:18:17,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:18:16" (2/3) ... [2023-12-16 04:18:17,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3decb0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:18:17, skipping insertion in model container [2023-12-16 04:18:17,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:18:17" (3/3) ... [2023-12-16 04:18:17,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-2.i [2023-12-16 04:18:17,536 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:18:17,536 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:18:17,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:18:17,582 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79a6dd4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:18:17,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:18:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:18:17,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:17,598 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:17,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:17,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash -447108497, now seen corresponding path program 1 times [2023-12-16 04:18:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:17,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090305847] [2023-12-16 04:18:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090305847] [2023-12-16 04:18:17,840 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:18:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559890921] [2023-12-16 04:18:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:17,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:17,847 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) [2023-12-16 04:18:17,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:18:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 04:18:18,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-12-16 04:18:18,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559890921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:18:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059706707] [2023-12-16 04:18:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:18,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:18:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:18,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:18:18,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:18,130 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:18,203 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2023-12-16 04:18:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:18:18,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2023-12-16 04:18:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:18,215 INFO L225 Difference]: With dead ends: 183 [2023-12-16 04:18:18,215 INFO L226 Difference]: Without dead ends: 91 [2023-12-16 04:18:18,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:18:18,221 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:18,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-16 04:18:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-16 04:18:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2023-12-16 04:18:18,266 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 95 [2023-12-16 04:18:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,266 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2023-12-16 04:18:18,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2023-12-16 04:18:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:18:18,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,270 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:18,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 04:18:18,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:18,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1556513981, now seen corresponding path program 1 times [2023-12-16 04:18:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055858043] [2023-12-16 04:18:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:18,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055858043] [2023-12-16 04:18:18,601 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:18:18,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722023634] [2023-12-16 04:18:18,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:18,613 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) [2023-12-16 04:18:18,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:18:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:18,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 04:18:18,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:18,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722023634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:18,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:18,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:18,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806850320] [2023-12-16 04:18:18,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:18,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:18,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:18,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:18,829 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:18,866 INFO L93 Difference]: Finished difference Result 182 states and 273 transitions. [2023-12-16 04:18:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2023-12-16 04:18:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:18,869 INFO L225 Difference]: With dead ends: 182 [2023-12-16 04:18:18,869 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 04:18:18,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:18,871 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:18,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 04:18:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-16 04:18:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2023-12-16 04:18:18,883 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 95 [2023-12-16 04:18:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:18,885 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2023-12-16 04:18:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2023-12-16 04:18:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:18:18,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:18,888 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:18,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:19,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 04:18:19,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2143319995, now seen corresponding path program 1 times [2023-12-16 04:18:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765675165] [2023-12-16 04:18:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765675165] [2023-12-16 04:18:19,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:18:19,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892467644] [2023-12-16 04:18:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:19,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:19,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:18:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:18:19,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-16 04:18:19,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892467644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537323094] [2023-12-16 04:18:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:19,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:19,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:19,456 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:19,520 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2023-12-16 04:18:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:19,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2023-12-16 04:18:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:19,523 INFO L225 Difference]: With dead ends: 189 [2023-12-16 04:18:19,523 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 04:18:19,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:19,527 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 10 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:19,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 385 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 04:18:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-16 04:18:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2023-12-16 04:18:19,539 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 95 [2023-12-16 04:18:19,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:19,541 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2023-12-16 04:18:19,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:18:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2023-12-16 04:18:19,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:18:19,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:19,550 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:19,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:19,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:19,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1085481917, now seen corresponding path program 1 times [2023-12-16 04:18:19,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:19,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824974349] [2023-12-16 04:18:19,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:19,797 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825617284] [2023-12-16 04:18:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:19,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:19,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:18:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:19,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:18:19,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:20,003 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824974349] [2023-12-16 04:18:20,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825617284] [2023-12-16 04:18:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825617284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:18:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614990156] [2023-12-16 04:18:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:20,007 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,050 INFO L93 Difference]: Finished difference Result 208 states and 309 transitions. [2023-12-16 04:18:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2023-12-16 04:18:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,053 INFO L225 Difference]: With dead ends: 208 [2023-12-16 04:18:20,053 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 04:18:20,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:20,055 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 61 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 392 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 04:18:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2023-12-16 04:18:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2023-12-16 04:18:20,064 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 95 [2023-12-16 04:18:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,065 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2023-12-16 04:18:20,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2023-12-16 04:18:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 04:18:20,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,067 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:20,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:20,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:20,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:20,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -229778144, now seen corresponding path program 1 times [2023-12-16 04:18:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767317994] [2023-12-16 04:18:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:20,317 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420731468] [2023-12-16 04:18:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:20,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:20,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:20,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:18:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 04:18:20,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:20,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767317994] [2023-12-16 04:18:20,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420731468] [2023-12-16 04:18:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420731468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:20,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:20,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356882552] [2023-12-16 04:18:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:20,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:18:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:18:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:20,539 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:20,565 INFO L93 Difference]: Finished difference Result 231 states and 341 transitions. [2023-12-16 04:18:20,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:18:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-16 04:18:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:20,567 INFO L225 Difference]: With dead ends: 231 [2023-12-16 04:18:20,567 INFO L226 Difference]: Without dead ends: 136 [2023-12-16 04:18:20,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:18:20,568 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 53 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:20,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 259 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:18:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-16 04:18:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2023-12-16 04:18:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 98 states have internal predecessors, (142), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:18:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2023-12-16 04:18:20,577 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 98 [2023-12-16 04:18:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:20,578 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2023-12-16 04:18:20,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2023-12-16 04:18:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 04:18:20,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:20,579 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:20,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:20,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:20,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:20,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:20,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1999686158, now seen corresponding path program 1 times [2023-12-16 04:18:20,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096440265] [2023-12-16 04:18:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:20,821 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166697347] [2023-12-16 04:18:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:20,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:20,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:20,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:20,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:18:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:20,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 04:18:20,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:21,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 04:18:21,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:21,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 28 [2023-12-16 04:18:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:21,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:21,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:21,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096440265] [2023-12-16 04:18:21,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:21,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166697347] [2023-12-16 04:18:21,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166697347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:21,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:21,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 04:18:21,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554193550] [2023-12-16 04:18:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:21,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:21,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:21,126 INFO L87 Difference]: Start difference. First operand 112 states and 166 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:21,450 INFO L93 Difference]: Finished difference Result 341 states and 501 transitions. [2023-12-16 04:18:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:18:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2023-12-16 04:18:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:21,452 INFO L225 Difference]: With dead ends: 341 [2023-12-16 04:18:21,452 INFO L226 Difference]: Without dead ends: 230 [2023-12-16 04:18:21,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:21,453 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 266 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:21,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 832 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-16 04:18:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2023-12-16 04:18:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.4285714285714286) internal successors, (240), 169 states have internal predecessors, (240), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:18:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2023-12-16 04:18:21,466 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 280 transitions. Word has length 98 [2023-12-16 04:18:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:21,467 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 280 transitions. [2023-12-16 04:18:21,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 280 transitions. [2023-12-16 04:18:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 04:18:21,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:21,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:21,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:21,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,677 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:21,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1741158119, now seen corresponding path program 1 times [2023-12-16 04:18:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794744815] [2023-12-16 04:18:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:21,708 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:21,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13615437] [2023-12-16 04:18:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:21,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:18:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:18:22,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:22,202 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:22,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794744815] [2023-12-16 04:18:22,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13615437] [2023-12-16 04:18:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13615437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:22,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:22,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:18:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936623426] [2023-12-16 04:18:22,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:22,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:18:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:18:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:18:22,204 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:22,346 INFO L93 Difference]: Finished difference Result 514 states and 756 transitions. [2023-12-16 04:18:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:18:22,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2023-12-16 04:18:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:22,350 INFO L225 Difference]: With dead ends: 514 [2023-12-16 04:18:22,350 INFO L226 Difference]: Without dead ends: 324 [2023-12-16 04:18:22,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:22,351 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 123 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:22,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 330 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:18:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-12-16 04:18:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 261. [2023-12-16 04:18:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 225 states have (on average 1.4133333333333333) internal successors, (318), 226 states have internal predecessors, (318), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 04:18:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 382 transitions. [2023-12-16 04:18:22,368 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 382 transitions. Word has length 100 [2023-12-16 04:18:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:22,368 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 382 transitions. [2023-12-16 04:18:22,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2023-12-16 04:18:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 04:18:22,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:22,369 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:22,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:22,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:22,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:22,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1306696792, now seen corresponding path program 1 times [2023-12-16 04:18:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894626724] [2023-12-16 04:18:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:22,594 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559870111] [2023-12-16 04:18:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:22,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:22,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:22,596 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:22,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 04:18:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:22,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 04:18:22,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:22,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:22,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 14 [2023-12-16 04:18:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:22,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894626724] [2023-12-16 04:18:22,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559870111] [2023-12-16 04:18:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559870111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179050937] [2023-12-16 04:18:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:22,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:22,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:22,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:22,849 INFO L87 Difference]: Start difference. First operand 261 states and 382 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:23,057 INFO L93 Difference]: Finished difference Result 627 states and 910 transitions. [2023-12-16 04:18:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2023-12-16 04:18:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:23,060 INFO L225 Difference]: With dead ends: 627 [2023-12-16 04:18:23,060 INFO L226 Difference]: Without dead ends: 437 [2023-12-16 04:18:23,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:23,061 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 150 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:23,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 519 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-12-16 04:18:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 392. [2023-12-16 04:18:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 342 states have (on average 1.394736842105263) internal successors, (477), 345 states have internal predecessors, (477), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 04:18:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 565 transitions. [2023-12-16 04:18:23,081 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 565 transitions. Word has length 101 [2023-12-16 04:18:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:23,081 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 565 transitions. [2023-12-16 04:18:23,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 565 transitions. [2023-12-16 04:18:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 04:18:23,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:23,082 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:23,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:23,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-16 04:18:23,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:23,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:23,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1699723802, now seen corresponding path program 1 times [2023-12-16 04:18:23,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:23,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482643248] [2023-12-16 04:18:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:23,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:23,313 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19550801] [2023-12-16 04:18:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:23,315 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:23,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 04:18:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:23,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 04:18:23,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:23,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-12-16 04:18:23,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:23,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-16 04:18:23,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:23,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 14 [2023-12-16 04:18:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 04:18:23,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:18:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482643248] [2023-12-16 04:18:23,783 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19550801] [2023-12-16 04:18:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19550801] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:18:23,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:18:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2023-12-16 04:18:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358218005] [2023-12-16 04:18:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:23,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:18:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:23,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:18:23,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:18:23,785 INFO L87 Difference]: Start difference. First operand 392 states and 565 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:24,389 INFO L93 Difference]: Finished difference Result 1276 states and 1849 transitions. [2023-12-16 04:18:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 04:18:24,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2023-12-16 04:18:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:24,394 INFO L225 Difference]: With dead ends: 1276 [2023-12-16 04:18:24,394 INFO L226 Difference]: Without dead ends: 959 [2023-12-16 04:18:24,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:18:24,396 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 350 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:24,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 981 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:18:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2023-12-16 04:18:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 702. [2023-12-16 04:18:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 618 states have (on average 1.396440129449838) internal successors, (863), 625 states have internal predecessors, (863), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 67 states have call predecessors, (74), 74 states have call successors, (74) [2023-12-16 04:18:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1011 transitions. [2023-12-16 04:18:24,432 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1011 transitions. Word has length 101 [2023-12-16 04:18:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:24,432 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 1011 transitions. [2023-12-16 04:18:24,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1011 transitions. [2023-12-16 04:18:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 04:18:24,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:24,434 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:24,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:24,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:24,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:24,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1030614582, now seen corresponding path program 1 times [2023-12-16 04:18:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863717337] [2023-12-16 04:18:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:24,666 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:24,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352280832] [2023-12-16 04:18:24,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:24,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:24,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:24,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:24,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-16 04:18:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:24,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 04:18:24,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:24,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:24,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-16 04:18:24,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:24,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-12-16 04:18:24,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:24,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 18 [2023-12-16 04:18:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:24,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:24,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863717337] [2023-12-16 04:18:24,935 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352280832] [2023-12-16 04:18:24,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352280832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:24,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:24,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:24,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764939792] [2023-12-16 04:18:24,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:24,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:18:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:18:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:24,937 INFO L87 Difference]: Start difference. First operand 702 states and 1011 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:25,240 INFO L93 Difference]: Finished difference Result 1724 states and 2480 transitions. [2023-12-16 04:18:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:25,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-16 04:18:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:25,246 INFO L225 Difference]: With dead ends: 1724 [2023-12-16 04:18:25,246 INFO L226 Difference]: Without dead ends: 1125 [2023-12-16 04:18:25,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:25,248 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 200 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:25,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 537 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2023-12-16 04:18:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 982. [2023-12-16 04:18:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 877 states have (on average 1.4002280501710376) internal successors, (1228), 888 states have internal predecessors, (1228), 90 states have call successors, (90), 14 states have call predecessors, (90), 14 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1408 transitions. [2023-12-16 04:18:25,289 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1408 transitions. Word has length 103 [2023-12-16 04:18:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:25,290 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1408 transitions. [2023-12-16 04:18:25,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1408 transitions. [2023-12-16 04:18:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 04:18:25,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:25,292 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:25,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:25,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 04:18:25,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:25,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1691280276, now seen corresponding path program 1 times [2023-12-16 04:18:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56869424] [2023-12-16 04:18:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:25,529 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:25,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631870098] [2023-12-16 04:18:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:25,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:25,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:25,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:25,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-16 04:18:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:25,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 04:18:25,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:25,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:25,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 21 [2023-12-16 04:18:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:25,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:25,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56869424] [2023-12-16 04:18:25,820 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631870098] [2023-12-16 04:18:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631870098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:25,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:25,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262751386] [2023-12-16 04:18:25,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:25,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:25,822 INFO L87 Difference]: Start difference. First operand 982 states and 1408 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:26,130 INFO L93 Difference]: Finished difference Result 2153 states and 3084 transitions. [2023-12-16 04:18:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:26,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-16 04:18:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:26,137 INFO L225 Difference]: With dead ends: 2153 [2023-12-16 04:18:26,137 INFO L226 Difference]: Without dead ends: 1278 [2023-12-16 04:18:26,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:26,140 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 114 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:26,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 458 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2023-12-16 04:18:26,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1264. [2023-12-16 04:18:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1139 states have (on average 1.404741000877963) internal successors, (1600), 1154 states have internal predecessors, (1600), 106 states have call successors, (106), 18 states have call predecessors, (106), 18 states have return successors, (106), 91 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-16 04:18:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1812 transitions. [2023-12-16 04:18:26,193 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1812 transitions. Word has length 103 [2023-12-16 04:18:26,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:26,193 INFO L495 AbstractCegarLoop]: Abstraction has 1264 states and 1812 transitions. [2023-12-16 04:18:26,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1812 transitions. [2023-12-16 04:18:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 04:18:26,195 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:26,195 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:26,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:26,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 04:18:26,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:26,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1786038570, now seen corresponding path program 1 times [2023-12-16 04:18:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:26,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817989118] [2023-12-16 04:18:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:26,419 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688964274] [2023-12-16 04:18:26,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:26,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:26,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:26,421 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:26,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-16 04:18:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:26,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 04:18:26,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:26,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:26,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2023-12-16 04:18:26,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:26,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-12-16 04:18:26,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:26,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2023-12-16 04:18:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:26,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:26,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817989118] [2023-12-16 04:18:26,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688964274] [2023-12-16 04:18:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688964274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:26,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587326753] [2023-12-16 04:18:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:26,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:18:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:18:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:26,702 INFO L87 Difference]: Start difference. First operand 1264 states and 1812 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:27,029 INFO L93 Difference]: Finished difference Result 2716 states and 3911 transitions. [2023-12-16 04:18:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:18:27,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-16 04:18:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:27,036 INFO L225 Difference]: With dead ends: 2716 [2023-12-16 04:18:27,036 INFO L226 Difference]: Without dead ends: 1618 [2023-12-16 04:18:27,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:27,039 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 211 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:27,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 749 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2023-12-16 04:18:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1266. [2023-12-16 04:18:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1141 states have (on average 1.4022787028922) internal successors, (1600), 1156 states have internal predecessors, (1600), 106 states have call successors, (106), 18 states have call predecessors, (106), 18 states have return successors, (106), 91 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-16 04:18:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1812 transitions. [2023-12-16 04:18:27,084 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1812 transitions. Word has length 103 [2023-12-16 04:18:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:27,084 INFO L495 AbstractCegarLoop]: Abstraction has 1266 states and 1812 transitions. [2023-12-16 04:18:27,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1812 transitions. [2023-12-16 04:18:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 04:18:27,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:27,086 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:27,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:27,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 04:18:27,294 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:27,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1249469300, now seen corresponding path program 1 times [2023-12-16 04:18:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:27,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363604031] [2023-12-16 04:18:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:27,317 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344110755] [2023-12-16 04:18:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:27,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:27,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:27,319 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:27,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-16 04:18:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:27,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 04:18:27,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:27,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:27,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 62 [2023-12-16 04:18:27,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:27,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 62 [2023-12-16 04:18:27,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:27,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 34 [2023-12-16 04:18:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:27,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363604031] [2023-12-16 04:18:27,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344110755] [2023-12-16 04:18:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344110755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:27,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357741448] [2023-12-16 04:18:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:27,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:18:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:27,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:18:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:27,753 INFO L87 Difference]: Start difference. First operand 1266 states and 1812 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:28,281 INFO L93 Difference]: Finished difference Result 2517 states and 3594 transitions. [2023-12-16 04:18:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-16 04:18:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:28,287 INFO L225 Difference]: With dead ends: 2517 [2023-12-16 04:18:28,287 INFO L226 Difference]: Without dead ends: 1417 [2023-12-16 04:18:28,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:18:28,289 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 196 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:28,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 909 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:18:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2023-12-16 04:18:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1000. [2023-12-16 04:18:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 891 states have (on average 1.3916947250280585) internal successors, (1240), 902 states have internal predecessors, (1240), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1420 transitions. [2023-12-16 04:18:28,328 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1420 transitions. Word has length 103 [2023-12-16 04:18:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:28,328 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1420 transitions. [2023-12-16 04:18:28,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1420 transitions. [2023-12-16 04:18:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 04:18:28,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:28,330 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:28,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-16 04:18:28,537 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:28,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1910134994, now seen corresponding path program 1 times [2023-12-16 04:18:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:28,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760449213] [2023-12-16 04:18:28,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:28,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:28,561 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:28,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542529106] [2023-12-16 04:18:28,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:28,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:28,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:28,562 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:28,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-16 04:18:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:28,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 04:18:28,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:28,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:28,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-16 04:18:28,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:28,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2023-12-16 04:18:28,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:28,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2023-12-16 04:18:28,841 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:28,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:28,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760449213] [2023-12-16 04:18:28,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542529106] [2023-12-16 04:18:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542529106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:28,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584553615] [2023-12-16 04:18:28,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:28,843 INFO L87 Difference]: Start difference. First operand 1000 states and 1420 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:29,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:29,115 INFO L93 Difference]: Finished difference Result 2142 states and 3036 transitions. [2023-12-16 04:18:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:29,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2023-12-16 04:18:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:29,121 INFO L225 Difference]: With dead ends: 2142 [2023-12-16 04:18:29,121 INFO L226 Difference]: Without dead ends: 1272 [2023-12-16 04:18:29,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:29,123 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 107 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:29,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 514 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2023-12-16 04:18:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1044. [2023-12-16 04:18:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 934 states have (on average 1.3929336188436832) internal successors, (1301), 945 states have internal predecessors, (1301), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1481 transitions. [2023-12-16 04:18:29,166 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1481 transitions. Word has length 103 [2023-12-16 04:18:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:29,168 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 1481 transitions. [2023-12-16 04:18:29,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1481 transitions. [2023-12-16 04:18:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:18:29,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:29,169 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:29,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:29,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:29,383 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:29,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash 547894548, now seen corresponding path program 1 times [2023-12-16 04:18:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:29,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161115208] [2023-12-16 04:18:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:29,414 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:29,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017966315] [2023-12-16 04:18:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:29,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:29,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:29,415 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:29,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-16 04:18:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:29,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:18:29,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:29,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:29,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 22 [2023-12-16 04:18:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:29,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161115208] [2023-12-16 04:18:29,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017966315] [2023-12-16 04:18:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017966315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:29,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:29,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068625449] [2023-12-16 04:18:29,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:29,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:29,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:29,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:29,675 INFO L87 Difference]: Start difference. First operand 1044 states and 1481 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:29,966 INFO L93 Difference]: Finished difference Result 2878 states and 4108 transitions. [2023-12-16 04:18:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:18:29,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-16 04:18:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:29,975 INFO L225 Difference]: With dead ends: 2878 [2023-12-16 04:18:29,975 INFO L226 Difference]: Without dead ends: 1996 [2023-12-16 04:18:29,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:18:29,978 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 199 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:29,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 459 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2023-12-16 04:18:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1050. [2023-12-16 04:18:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 940 states have (on average 1.3882978723404256) internal successors, (1305), 951 states have internal predecessors, (1305), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1485 transitions. [2023-12-16 04:18:30,032 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1485 transitions. Word has length 104 [2023-12-16 04:18:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:30,032 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1485 transitions. [2023-12-16 04:18:30,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1485 transitions. [2023-12-16 04:18:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:18:30,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:30,034 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:30,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-16 04:18:30,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-16 04:18:30,242 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:30,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 940921558, now seen corresponding path program 1 times [2023-12-16 04:18:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895199122] [2023-12-16 04:18:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:30,269 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [387506602] [2023-12-16 04:18:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:30,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:30,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:30,270 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:30,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-16 04:18:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:30,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 04:18:30,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:30,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 04:18:30,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:30,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 19 [2023-12-16 04:18:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:30,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895199122] [2023-12-16 04:18:30,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387506602] [2023-12-16 04:18:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387506602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:30,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:30,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:18:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896083289] [2023-12-16 04:18:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:30,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:18:30,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:18:30,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:30,548 INFO L87 Difference]: Start difference. First operand 1050 states and 1485 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:30,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:30,915 INFO L93 Difference]: Finished difference Result 2350 states and 3314 transitions. [2023-12-16 04:18:30,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:18:30,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-16 04:18:30,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:30,920 INFO L225 Difference]: With dead ends: 2350 [2023-12-16 04:18:30,920 INFO L226 Difference]: Without dead ends: 1462 [2023-12-16 04:18:30,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:30,923 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 243 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:30,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 665 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:18:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2023-12-16 04:18:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1055. [2023-12-16 04:18:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 945 states have (on average 1.3873015873015873) internal successors, (1311), 956 states have internal predecessors, (1311), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1491 transitions. [2023-12-16 04:18:30,966 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1491 transitions. Word has length 104 [2023-12-16 04:18:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:30,966 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1491 transitions. [2023-12-16 04:18:30,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1491 transitions. [2023-12-16 04:18:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 04:18:30,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:30,968 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:30,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:31,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-16 04:18:31,178 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:31,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash 829709734, now seen corresponding path program 1 times [2023-12-16 04:18:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907237052] [2023-12-16 04:18:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:31,203 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045321902] [2023-12-16 04:18:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:31,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:31,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:31,205 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:31,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-16 04:18:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:31,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 04:18:31,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:31,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:31,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2023-12-16 04:18:31,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:31,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 46 [2023-12-16 04:18:31,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 21 [2023-12-16 04:18:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:31,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907237052] [2023-12-16 04:18:31,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045321902] [2023-12-16 04:18:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045321902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:18:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859314371] [2023-12-16 04:18:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:31,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:18:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:18:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:18:31,500 INFO L87 Difference]: Start difference. First operand 1055 states and 1491 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:31,925 INFO L93 Difference]: Finished difference Result 2155 states and 3047 transitions. [2023-12-16 04:18:31,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:18:31,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2023-12-16 04:18:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:31,930 INFO L225 Difference]: With dead ends: 2155 [2023-12-16 04:18:31,931 INFO L226 Difference]: Without dead ends: 1262 [2023-12-16 04:18:31,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:18:31,933 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 198 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:31,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 715 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:18:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2023-12-16 04:18:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1050. [2023-12-16 04:18:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 940 states have (on average 1.3861702127659574) internal successors, (1303), 951 states have internal predecessors, (1303), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1483 transitions. [2023-12-16 04:18:31,974 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1483 transitions. Word has length 104 [2023-12-16 04:18:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:31,975 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1483 transitions. [2023-12-16 04:18:31,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1483 transitions. [2023-12-16 04:18:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:18:31,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:31,976 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:31,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:32,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-16 04:18:32,184 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:32,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1287465970, now seen corresponding path program 1 times [2023-12-16 04:18:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687552332] [2023-12-16 04:18:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:32,201 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891701698] [2023-12-16 04:18:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:32,202 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:32,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-16 04:18:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:32,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 04:18:32,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:32,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-12-16 04:18:32,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:32,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-16 04:18:32,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:32,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 14 [2023-12-16 04:18:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-16 04:18:32,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:18:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687552332] [2023-12-16 04:18:32,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891701698] [2023-12-16 04:18:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891701698] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:18:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:18:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2023-12-16 04:18:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897292011] [2023-12-16 04:18:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:32,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:18:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:18:32,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:18:32,809 INFO L87 Difference]: Start difference. First operand 1050 states and 1483 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:33,506 INFO L93 Difference]: Finished difference Result 2611 states and 3712 transitions. [2023-12-16 04:18:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:18:33,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-12-16 04:18:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:33,512 INFO L225 Difference]: With dead ends: 2611 [2023-12-16 04:18:33,512 INFO L226 Difference]: Without dead ends: 1723 [2023-12-16 04:18:33,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2023-12-16 04:18:33,514 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 338 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:33,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1542 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:18:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2023-12-16 04:18:33,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1112. [2023-12-16 04:18:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1002 states have (on average 1.3862275449101797) internal successors, (1389), 1013 states have internal predecessors, (1389), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1569 transitions. [2023-12-16 04:18:33,559 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1569 transitions. Word has length 105 [2023-12-16 04:18:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:33,559 INFO L495 AbstractCegarLoop]: Abstraction has 1112 states and 1569 transitions. [2023-12-16 04:18:33,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1569 transitions. [2023-12-16 04:18:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 04:18:33,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:33,561 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:33,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:33,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-16 04:18:33,771 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:33,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -894438960, now seen corresponding path program 1 times [2023-12-16 04:18:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412993045] [2023-12-16 04:18:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:33,791 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:33,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1359375569] [2023-12-16 04:18:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:33,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:33,793 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:33,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-16 04:18:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:18:34,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 04:18:34,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:18:34,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:18:34,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 14 [2023-12-16 04:18:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:18:34,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:18:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:18:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412993045] [2023-12-16 04:18:34,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:18:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359375569] [2023-12-16 04:18:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359375569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:18:34,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:18:34,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:18:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636315904] [2023-12-16 04:18:34,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:18:34,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:18:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:18:34,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:18:34,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:18:34,077 INFO L87 Difference]: Start difference. First operand 1112 states and 1569 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:18:34,309 INFO L93 Difference]: Finished difference Result 2426 states and 3418 transitions. [2023-12-16 04:18:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:18:34,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-12-16 04:18:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:18:34,315 INFO L225 Difference]: With dead ends: 2426 [2023-12-16 04:18:34,315 INFO L226 Difference]: Without dead ends: 1501 [2023-12-16 04:18:34,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:18:34,317 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 110 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:18:34,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 530 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:18:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2023-12-16 04:18:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1120. [2023-12-16 04:18:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1010 states have (on average 1.384158415841584) internal successors, (1398), 1021 states have internal predecessors, (1398), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-16 04:18:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1578 transitions. [2023-12-16 04:18:34,386 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1578 transitions. Word has length 105 [2023-12-16 04:18:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:18:34,386 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1578 transitions. [2023-12-16 04:18:34,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:18:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1578 transitions. [2023-12-16 04:18:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 04:18:34,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:18:34,388 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:34,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-16 04:18:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:34,596 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:18:34,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:18:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1967397668, now seen corresponding path program 1 times [2023-12-16 04:18:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:18:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62938836] [2023-12-16 04:18:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:18:34,623 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:18:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880223168] [2023-12-16 04:18:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:18:34,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:34,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:18:34,624 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:18:34,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-16 04:18:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:34,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:18:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:18:35,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:18:35,096 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:18:35,097 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:18:35,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-16 04:18:35,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:18:35,310 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:18:35,313 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:18:35,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:18:35 BoogieIcfgContainer [2023-12-16 04:18:35,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:18:35,387 INFO L158 Benchmark]: Toolchain (without parser) took 19141.74ms. Allocated memory was 304.1MB in the beginning and 457.2MB in the end (delta: 153.1MB). Free memory was 251.5MB in the beginning and 353.1MB in the end (delta: -101.6MB). Peak memory consumption was 52.5MB. Max. memory is 8.0GB. [2023-12-16 04:18:35,387 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:18:35,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.30ms. Allocated memory is still 304.1MB. Free memory was 251.5MB in the beginning and 235.3MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 04:18:35,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.16ms. Allocated memory is still 304.1MB. Free memory was 235.3MB in the beginning and 230.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:35,388 INFO L158 Benchmark]: Boogie Preprocessor took 103.13ms. Allocated memory is still 304.1MB. Free memory was 230.5MB in the beginning and 225.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:18:35,388 INFO L158 Benchmark]: RCFGBuilder took 771.83ms. Allocated memory is still 304.1MB. Free memory was 225.3MB in the beginning and 189.1MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-16 04:18:35,388 INFO L158 Benchmark]: TraceAbstraction took 17871.52ms. Allocated memory was 304.1MB in the beginning and 457.2MB in the end (delta: 153.1MB). Free memory was 188.6MB in the beginning and 353.1MB in the end (delta: -164.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:18:35,389 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.30ms. Allocated memory is still 304.1MB. Free memory was 251.5MB in the beginning and 235.3MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.16ms. Allocated memory is still 304.1MB. Free memory was 235.3MB in the beginning and 230.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.13ms. Allocated memory is still 304.1MB. Free memory was 230.5MB in the beginning and 225.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 771.83ms. Allocated memory is still 304.1MB. Free memory was 225.3MB in the beginning and 189.1MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 17871.52ms. Allocated memory was 304.1MB in the beginning and 457.2MB in the end (delta: 153.1MB). Free memory was 188.6MB in the beginning and 353.1MB in the end (delta: -164.5MB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of bitwise operation at line 88, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L31] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L32] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L84] EXPR unsigned_short_int_Array_0[0][0] [L84] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L85] EXPR unsigned_short_int_Array_0[1][2] [L85] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L66] float_Array_0[0] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L68] float_Array_0[1] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[1] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L69] EXPR float_Array_0[1] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L70] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L71] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L71] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L73] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L74] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L74] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L76] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L77] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L77] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L79] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L80] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L96] RET updateVariables() [L97] CALL step() [L36] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L37] EXPR unsigned_short_int_Array_0[0][2] [L37] EXPR unsigned_short_int_Array_0[1][1] [L37] EXPR unsigned_short_int_Array_0[0][1] [L37] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) [L37] EXPR unsigned_short_int_Array_0[1][0] [L37] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) [L37] EXPR unsigned_short_int_Array_0[0][2] [L37] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] unsigned_short_int_Array_0[1][2] = ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))) [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) [L39] EXPR unsigned_short_int_Array_0[1][1] [L39] EXPR unsigned_short_int_Array_0[1][0] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L39] COND FALSE !(BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) [L50] EXPR unsigned_short_int_Array_0[1][1] [L50] unsigned_short_int_Array_0[0][0] = unsigned_short_int_Array_0[1][1] [L52] EXPR unsigned_short_int_Array_0[0][1] [L52] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L52] COND FALSE !(unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) [L59] EXPR float_Array_0[0] [L59] float_Array_0[2] = float_Array_0[0] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1 [L88] EXPR unsigned_short_int_Array_0[1][2] [L88] EXPR unsigned_short_int_Array_0[0][2] [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR unsigned_short_int_Array_0[0][1] [L88] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) [L88] EXPR unsigned_short_int_Array_0[1][0] [L88] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) [L88] EXPR unsigned_short_int_Array_0[0][2] [L88] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) [L88] EXPR BOOL_unsigned_char_Array_0[0] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR unsigned_short_int_Array_0[1][0] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])) [L88] EXPR unsigned_short_int_Array_0[0][0] [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) [L88] EXPR unsigned_short_int_Array_0[0][1] [L88] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0])) [L88] EXPR float_Array_0[2] [L88] EXPR float_Array_0[0] [L88] EXPR (unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88-L89] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2930 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2929 mSDsluCounter, 11165 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8221 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4176 IncrementalHoareTripleChecker+Invalid, 4266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 2944 mSDtfsCounter, 4176 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2148 GetRequests, 2017 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1266occurred in iteration=12, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 4162 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2306 NumberOfCodeBlocks, 2306 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2100 ConstructedInterpolants, 0 QuantifiedInterpolants, 5274 SizeOfPredicates, 136 NumberOfNonLiveVariables, 6941 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 5478/5544 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 could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:18:35,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...