/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_fillercode_fillercodestructure_filler-pe-ci_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 20:31:42,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 20:31:42,372 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-20 20:31:42,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 20:31:42,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 20:31:42,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 20:31:42,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 20:31:42,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 20:31:42,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 20:31:42,390 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 20:31:42,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 20:31:42,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 20:31:42,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 20:31:42,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 20:31:42,391 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 20:31:42,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 20:31:42,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 20:31:42,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 20:31:42,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 20:31:42,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 20:31:42,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 20:31:42,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 20:31:42,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 20:31:42,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 20:31:42,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 20:31:42,397 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 20:31:42,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 20:31:42,398 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 20:31:42,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 20:31:42,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 20:31:42,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 20:31:42,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 20:31:42,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 20:31:42,399 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 20:31:42,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 20:31:42,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 20:31:42,400 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-20 20:31:42,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 20:31:42,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 20:31:42,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 20:31:42,603 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 20:31:42,604 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 20:31:42,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i [2023-12-20 20:31:43,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 20:31:43,800 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 20:31:43,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i [2023-12-20 20:31:43,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307026f9a/61e333c9350e425f95e2c31561f2c5fb/FLAG9aa928faf [2023-12-20 20:31:43,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307026f9a/61e333c9350e425f95e2c31561f2c5fb [2023-12-20 20:31:43,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 20:31:43,829 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 20:31:43,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 20:31:43,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 20:31:43,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 20:31:43,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 08:31:43" (1/1) ... [2023-12-20 20:31:43,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20550ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:43, skipping insertion in model container [2023-12-20 20:31:43,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 08:31:43" (1/1) ... [2023-12-20 20:31:43,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 20:31:43,986 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_fillercode_fillercodestructure_filler-pe-ci_file-10.i[919,932] [2023-12-20 20:31:44,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 20:31:44,084 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 20:31:44,094 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_fillercode_fillercodestructure_filler-pe-ci_file-10.i[919,932] [2023-12-20 20:31:44,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 20:31:44,140 INFO L206 MainTranslator]: Completed translation [2023-12-20 20:31:44,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44 WrapperNode [2023-12-20 20:31:44,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 20:31:44,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 20:31:44,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 20:31:44,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 20:31:44,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,196 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2023-12-20 20:31:44,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 20:31:44,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 20:31:44,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 20:31:44,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 20:31:44,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 20:31:44,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 20:31:44,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 20:31:44,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 20:31:44,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 20:31:44,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (1/1) ... [2023-12-20 20:31:44,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 20:31:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:44,296 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-20 20:31:44,301 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-20 20:31:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 20:31:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 20:31:44,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 20:31:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 20:31:44,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 20:31:44,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 20:31:44,410 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 20:31:44,413 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 20:31:44,724 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 20:31:44,753 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 20:31:44,753 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 20:31:44,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 08:31:44 BoogieIcfgContainer [2023-12-20 20:31:44,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 20:31:44,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 20:31:44,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 20:31:44,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 20:31:44,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 08:31:43" (1/3) ... [2023-12-20 20:31:44,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478a3cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 08:31:44, skipping insertion in model container [2023-12-20 20:31:44,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 08:31:44" (2/3) ... [2023-12-20 20:31:44,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478a3cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 08:31:44, skipping insertion in model container [2023-12-20 20:31:44,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 08:31:44" (3/3) ... [2023-12-20 20:31:44,760 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-10.i [2023-12-20 20:31:44,777 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 20:31:44,777 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 20:31:44,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 20:31:44,823 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;@4e0f700d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 20:31:44,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 20:31:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-20 20:31:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:31:44,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:31:44,840 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:31:44,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:31:44,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:31:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1200180759, now seen corresponding path program 1 times [2023-12-20 20:31:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:31:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255621266] [2023-12-20 20:31:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:31:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:31:45,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255621266] [2023-12-20 20:31:45,085 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-20 20:31:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933614642] [2023-12-20 20:31:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:45,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:31:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:45,088 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-20 20:31:45,095 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-20 20:31:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:45,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-20 20:31:45,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:31:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2023-12-20 20:31:45,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:31:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933614642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:31:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:31:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 20:31:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963168814] [2023-12-20 20:31:45,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:31:45,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 20:31:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:31:45,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 20:31:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 20:31:45,364 INFO L87 Difference]: Start difference. First operand has 98 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-20 20:31:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:31:45,401 INFO L93 Difference]: Finished difference Result 193 states and 346 transitions. [2023-12-20 20:31:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 20:31:45,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2023-12-20 20:31:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:31:45,414 INFO L225 Difference]: With dead ends: 193 [2023-12-20 20:31:45,414 INFO L226 Difference]: Without dead ends: 96 [2023-12-20 20:31:45,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 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-20 20:31:45,423 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:31:45,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:31:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-20 20:31:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-20 20:31:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-20 20:31:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 152 transitions. [2023-12-20 20:31:45,479 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 152 transitions. Word has length 215 [2023-12-20 20:31:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:31:45,479 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 152 transitions. [2023-12-20 20:31:45,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-20 20:31:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 152 transitions. [2023-12-20 20:31:45,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:31:45,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:31:45,490 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:31:45,499 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-20 20:31:45,695 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-20 20:31:45,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:31:45,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:31:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1626255281, now seen corresponding path program 1 times [2023-12-20 20:31:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:31:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931806267] [2023-12-20 20:31:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:31:45,776 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:31:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111968290] [2023-12-20 20:31:45,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:45,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:31:45,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:45,778 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-20 20:31:45,804 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-20 20:31:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:45,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 20:31:45,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:31:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:31:45,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:31:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:31:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931806267] [2023-12-20 20:31:45,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:31:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111968290] [2023-12-20 20:31:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111968290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:31:45,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:31:45,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 20:31:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065779214] [2023-12-20 20:31:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:31:45,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 20:31:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:31:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 20:31:45,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 20:31:45,999 INFO L87 Difference]: Start difference. First operand 96 states and 152 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:31:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:31:46,072 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2023-12-20 20:31:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 20:31:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:31:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:31:46,078 INFO L225 Difference]: With dead ends: 230 [2023-12-20 20:31:46,078 INFO L226 Difference]: Without dead ends: 135 [2023-12-20 20:31:46,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 213 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-20 20:31:46,081 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 53 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:31:46,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 278 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:31:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-20 20:31:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2023-12-20 20:31:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 20:31:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 207 transitions. [2023-12-20 20:31:46,106 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 207 transitions. Word has length 215 [2023-12-20 20:31:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:31:46,107 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 207 transitions. [2023-12-20 20:31:46,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:31:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 207 transitions. [2023-12-20 20:31:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-20 20:31:46,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:31:46,125 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:31:46,133 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-20 20:31:46,330 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-20 20:31:46,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:31:46,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:31:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1233228271, now seen corresponding path program 1 times [2023-12-20 20:31:46,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:31:46,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871987878] [2023-12-20 20:31:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:46,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:31:46,382 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:31:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267158807] [2023-12-20 20:31:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:46,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:31:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:46,385 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-20 20:31:46,392 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-20 20:31:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:46,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 20:31:46,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:31:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:31:46,727 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:31:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:31:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871987878] [2023-12-20 20:31:46,728 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:31:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267158807] [2023-12-20 20:31:46,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267158807] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:31:46,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:31:46,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 20:31:46,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31564382] [2023-12-20 20:31:46,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:31:46,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 20:31:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:31:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 20:31:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 20:31:46,730 INFO L87 Difference]: Start difference. First operand 132 states and 207 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:31:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:31:46,864 INFO L93 Difference]: Finished difference Result 384 states and 601 transitions. [2023-12-20 20:31:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 20:31:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2023-12-20 20:31:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:31:46,868 INFO L225 Difference]: With dead ends: 384 [2023-12-20 20:31:46,868 INFO L226 Difference]: Without dead ends: 253 [2023-12-20 20:31:46,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 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-20 20:31:46,871 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 20:31:46,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 434 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 20:31:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-12-20 20:31:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2023-12-20 20:31:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 116 states have internal predecessors, (151), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-20 20:31:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 303 transitions. [2023-12-20 20:31:46,912 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 303 transitions. Word has length 215 [2023-12-20 20:31:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:31:46,913 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 303 transitions. [2023-12-20 20:31:46,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:31:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 303 transitions. [2023-12-20 20:31:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:31:46,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:31:46,915 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:31:46,948 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-20 20:31:47,120 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-20 20:31:47,120 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:31:47,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:31:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1030594461, now seen corresponding path program 1 times [2023-12-20 20:31:47,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:31:47,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362105659] [2023-12-20 20:31:47,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:47,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:31:47,146 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:31:47,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316026523] [2023-12-20 20:31:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:31:47,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:31:47,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:31:47,148 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-20 20:31:47,173 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-20 20:31:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:31:47,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-20 20:31:47,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:31:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1193 proven. 489 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2023-12-20 20:31:59,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:32:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:32:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:32:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362105659] [2023-12-20 20:32:25,313 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:32:25,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316026523] [2023-12-20 20:32:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316026523] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:32:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:32:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [39] total 51 [2023-12-20 20:32:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547763339] [2023-12-20 20:32:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:32:25,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 20:32:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:32:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 20:32:25,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=2094, Unknown=0, NotChecked=0, Total=2550 [2023-12-20 20:32:25,315 INFO L87 Difference]: Start difference. First operand 196 states and 303 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:33:13,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:33:19,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:33:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:33:45,157 INFO L93 Difference]: Finished difference Result 890 states and 1447 transitions. [2023-12-20 20:33:45,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-20 20:33:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2023-12-20 20:33:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:33:45,160 INFO L225 Difference]: With dead ends: 890 [2023-12-20 20:33:45,161 INFO L226 Difference]: Without dead ends: 759 [2023-12-20 20:33:45,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3456 ImplicationChecksByTransitivity, 78.4s TimeCoverageRelationStatistics Valid=1184, Invalid=8128, Unknown=0, NotChecked=0, Total=9312 [2023-12-20 20:33:45,163 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 1805 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:33:45,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1805 Valid, 1284 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-12-20 20:33:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-20 20:33:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 219. [2023-12-20 20:33:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 138 states have (on average 1.355072463768116) internal successors, (187), 139 states have internal predecessors, (187), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-20 20:33:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 339 transitions. [2023-12-20 20:33:45,179 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 339 transitions. Word has length 216 [2023-12-20 20:33:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:33:45,180 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 339 transitions. [2023-12-20 20:33:45,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:33:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 339 transitions. [2023-12-20 20:33:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:33:45,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:33:45,181 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:33:45,201 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-20 20:33:45,382 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-20 20:33:45,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:33:45,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:33:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -373549799, now seen corresponding path program 1 times [2023-12-20 20:33:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:33:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592785899] [2023-12-20 20:33:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:33:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:33:45,410 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:33:45,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280259394] [2023-12-20 20:33:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:33:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:33:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:33:45,418 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-20 20:33:45,418 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-20 20:33:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:33:45,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 20:33:45,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:33:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:33:45,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:33:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:33:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592785899] [2023-12-20 20:33:45,565 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:33:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280259394] [2023-12-20 20:33:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280259394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:33:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:33:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 20:33:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756430641] [2023-12-20 20:33:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:33:45,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 20:33:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:33:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 20:33:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 20:33:45,566 INFO L87 Difference]: Start difference. First operand 219 states and 339 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:33:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:33:45,599 INFO L93 Difference]: Finished difference Result 388 states and 601 transitions. [2023-12-20 20:33:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 20:33:45,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2023-12-20 20:33:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:33:45,603 INFO L225 Difference]: With dead ends: 388 [2023-12-20 20:33:45,603 INFO L226 Difference]: Without dead ends: 234 [2023-12-20 20:33:45,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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-20 20:33:45,604 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 55 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:33:45,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 322 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:33:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-12-20 20:33:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 208. [2023-12-20 20:33:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 135 states have internal predecessors, (185), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:33:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 321 transitions. [2023-12-20 20:33:45,631 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 321 transitions. Word has length 216 [2023-12-20 20:33:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:33:45,633 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 321 transitions. [2023-12-20 20:33:45,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:33:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2023-12-20 20:33:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:33:45,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:33:45,635 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:33:45,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-20 20:33:45,840 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-20 20:33:45,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:33:45,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:33:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 306508571, now seen corresponding path program 1 times [2023-12-20 20:33:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:33:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688353400] [2023-12-20 20:33:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:33:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:33:45,862 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:33:45,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702056716] [2023-12-20 20:33:45,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:33:45,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:33:45,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:33:45,863 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-20 20:33:45,868 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-20 20:33:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:33:45,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 20:33:45,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:33:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 849 proven. 75 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2023-12-20 20:33:46,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:33:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2023-12-20 20:33:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:33:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688353400] [2023-12-20 20:33:46,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:33:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702056716] [2023-12-20 20:33:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702056716] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:33:46,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:33:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-20 20:33:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693353011] [2023-12-20 20:33:46,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:33:46,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 20:33:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:33:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 20:33:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 20:33:46,279 INFO L87 Difference]: Start difference. First operand 208 states and 321 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-20 20:33:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:33:46,451 INFO L93 Difference]: Finished difference Result 348 states and 530 transitions. [2023-12-20 20:33:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 20:33:46,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 216 [2023-12-20 20:33:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:33:46,462 INFO L225 Difference]: With dead ends: 348 [2023-12-20 20:33:46,462 INFO L226 Difference]: Without dead ends: 205 [2023-12-20 20:33:46,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-20 20:33:46,464 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 20:33:46,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 225 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 20:33:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-20 20:33:46,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2023-12-20 20:33:46,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 118 states have internal predecessors, (149), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:33:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 285 transitions. [2023-12-20 20:33:46,478 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 285 transitions. Word has length 216 [2023-12-20 20:33:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:33:46,479 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 285 transitions. [2023-12-20 20:33:46,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2023-12-20 20:33:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 285 transitions. [2023-12-20 20:33:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:33:46,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:33:46,480 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:33:46,488 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-20 20:33:46,686 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-20 20:33:46,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:33:46,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:33:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1604583581, now seen corresponding path program 1 times [2023-12-20 20:33:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:33:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700042783] [2023-12-20 20:33:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:33:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:33:46,721 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:33:46,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468240119] [2023-12-20 20:33:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:33:46,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:33:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:33:46,722 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-20 20:33:46,725 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-20 20:33:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:33:46,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-20 20:33:46,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:33:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1212 proven. 270 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2023-12-20 20:33:47,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:34:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 90 proven. 198 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2023-12-20 20:34:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:34:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700042783] [2023-12-20 20:34:36,824 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:34:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468240119] [2023-12-20 20:34:36,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468240119] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:34:36,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:34:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-20 20:34:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367122928] [2023-12-20 20:34:36,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:34:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-20 20:34:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:34:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-20 20:34:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2023-12-20 20:34:36,827 INFO L87 Difference]: Start difference. First operand 193 states and 285 transitions. Second operand has 28 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 9 states have call successors, (67), 5 states have call predecessors, (67), 11 states have return successors, (68), 8 states have call predecessors, (68), 9 states have call successors, (68) [2023-12-20 20:34:48,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:34:54,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:34:58,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:02,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:04,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:10,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:15,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:17,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:22,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:26,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:28,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:33,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:37,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:41,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:46,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:50,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:52,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:56,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:35:58,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:02,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:06,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:12,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:13,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:17,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:20,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:36:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:36:22,670 INFO L93 Difference]: Finished difference Result 384 states and 540 transitions. [2023-12-20 20:36:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-20 20:36:22,672 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 9 states have call successors, (67), 5 states have call predecessors, (67), 11 states have return successors, (68), 8 states have call predecessors, (68), 9 states have call successors, (68) Word has length 216 [2023-12-20 20:36:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:36:22,673 INFO L225 Difference]: With dead ends: 384 [2023-12-20 20:36:22,673 INFO L226 Difference]: Without dead ends: 260 [2023-12-20 20:36:22,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=443, Invalid=963, Unknown=0, NotChecked=0, Total=1406 [2023-12-20 20:36:22,675 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 392 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 24 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.5s IncrementalHoareTripleChecker+Time [2023-12-20 20:36:22,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 508 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 645 Invalid, 11 Unknown, 0 Unchecked, 101.5s Time] [2023-12-20 20:36:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-20 20:36:22,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2023-12-20 20:36:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 154 states have (on average 1.2532467532467533) internal successors, (193), 154 states have internal predecessors, (193), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:36:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 329 transitions. [2023-12-20 20:36:22,692 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 329 transitions. Word has length 216 [2023-12-20 20:36:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:36:22,692 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 329 transitions. [2023-12-20 20:36:22,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.37037037037037) internal successors, (118), 26 states have internal predecessors, (118), 9 states have call successors, (67), 5 states have call predecessors, (67), 11 states have return successors, (68), 8 states have call predecessors, (68), 9 states have call successors, (68) [2023-12-20 20:36:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 329 transitions. [2023-12-20 20:36:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:36:22,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:36:22,695 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:36:22,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-20 20:36:22,900 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-20 20:36:22,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:36:22,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:36:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash -557753441, now seen corresponding path program 1 times [2023-12-20 20:36:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:36:22,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939977419] [2023-12-20 20:36:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:36:22,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:36:22,929 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:36:22,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417908020] [2023-12-20 20:36:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:36:22,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:36:22,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:36:22,931 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-20 20:36:22,937 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-20 20:36:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:36:23,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-20 20:36:23,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:36:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:36:27,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:36:27,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:36:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939977419] [2023-12-20 20:36:27,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:36:27,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417908020] [2023-12-20 20:36:27,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417908020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:36:27,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:36:27,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 20:36:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214611665] [2023-12-20 20:36:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:36:27,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 20:36:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:36:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 20:36:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-20 20:36:27,265 INFO L87 Difference]: Start difference. First operand 237 states and 329 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:36:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:36:28,225 INFO L93 Difference]: Finished difference Result 574 states and 830 transitions. [2023-12-20 20:36:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-20 20:36:28,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2023-12-20 20:36:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:36:28,227 INFO L225 Difference]: With dead ends: 574 [2023-12-20 20:36:28,227 INFO L226 Difference]: Without dead ends: 398 [2023-12-20 20:36:28,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2023-12-20 20:36:28,229 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 404 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 20:36:28,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 820 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 20:36:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-12-20 20:36:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 247. [2023-12-20 20:36:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 164 states have (on average 1.2621951219512195) internal successors, (207), 164 states have internal predecessors, (207), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:36:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 343 transitions. [2023-12-20 20:36:28,247 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 343 transitions. Word has length 216 [2023-12-20 20:36:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:36:28,247 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 343 transitions. [2023-12-20 20:36:28,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:36:28,248 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 343 transitions. [2023-12-20 20:36:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:36:28,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:36:28,250 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:36:28,262 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-20 20:36:28,456 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-20 20:36:28,456 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:36:28,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:36:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1458934501, now seen corresponding path program 1 times [2023-12-20 20:36:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:36:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060401636] [2023-12-20 20:36:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:36:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:36:28,477 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:36:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307652530] [2023-12-20 20:36:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:36:28,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:36:28,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:36:28,479 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-20 20:36:28,504 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-20 20:36:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:36:28,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-20 20:36:28,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:36:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1263 proven. 414 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2023-12-20 20:36:35,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:37:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:37:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:37:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060401636] [2023-12-20 20:37:59,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:37:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307652530] [2023-12-20 20:37:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307652530] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:37:59,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:37:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [36] total 48 [2023-12-20 20:37:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960057992] [2023-12-20 20:37:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:37:59,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 20:37:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:37:59,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 20:37:59,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1789, Unknown=3, NotChecked=0, Total=2256 [2023-12-20 20:37:59,716 INFO L87 Difference]: Start difference. First operand 247 states and 343 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:38:03,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse77 (* 65535 c_~var_1_5~0)) (.cse100 (* c_~var_1_6~0 65535)) (.cse40 (mod c_~var_1_6~0 65536)) (.cse82 (mod c_~var_1_7~0 65536)) (.cse84 (mod c_~var_1_4~0 65536)) (.cse13 (mod c_~var_1_5~0 65536))) (let ((.cse94 (+ .cse13 c_~var_1_11~0)) (.cse93 (mod c_~var_1_16~0 65536)) (.cse11 (+ .cse13 1)) (.cse6 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse37 (< 56892 .cse84)) (.cse96 (< .cse40 (+ .cse82 1))) (.cse76 (mod (+ .cse77 .cse100 c_~var_1_4~0) 65536)) (.cse35 (mod (+ .cse77 .cse100 56892) 65536)) (.cse36 (< .cse84 56893)) (.cse83 (mod c_~var_1_1~0 65536))) (let ((.cse92 (let ((.cse98 (* 65535 c_~var_1_7~0))) (let ((.cse97 (< .cse82 .cse40)) (.cse99 (= .cse83 (mod (+ .cse77 .cse98 56892) 65536)))) (and (or .cse97 .cse37 (= .cse83 (mod (+ .cse77 c_~var_1_4~0 .cse98) 65536))) (or (and (or .cse99 .cse97 .cse36) (or .cse37 .cse96)) (= .cse83 .cse76)) (or (and .cse99 (<= .cse40 .cse82)) (= .cse83 .cse35) .cse36))))) (.cse89 (mod c_~var_1_8~0 256)) (.cse41 (mod (+ .cse77 c_~var_1_4~0) 65536)) (.cse4 (mod c_~var_1_14~0 65536)) (.cse90 (not .cse6)) (.cse91 (let ((.cse95 (= .cse83 .cse13))) (and (or (< .cse82 .cse11) .cse95 .cse96) (or (< .cse40 .cse11) (< .cse13 .cse82) .cse95)))) (.cse80 (< .cse94 (+ .cse93 1))) (.cse86 (< .cse93 .cse94))) (let ((.cse7 (and (or .cse80 (< (+ (* 65536 (div (+ (* (- 1) .cse13) .cse84) 65536)) c_~var_1_13~0 .cse13) .cse84)) (or .cse86 (< (+ (* 65536 (div (+ (* (- 1) .cse93) .cse84 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse93) (+ .cse84 c_~var_1_11~0))))) (.cse81 (or .cse90 .cse91)) (.cse78 (= .cse41 .cse4)) (.cse85 (= 1 .cse89)) (.cse88 (or .cse92 .cse6)) (.cse87 (= .cse4 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))) (let ((.cse3 (and .cse81 (or .cse78 .cse80) .cse85 .cse88 (or .cse86 .cse87))) (.cse0 (or .cse92 .cse6 .cse7)) (.cse1 (or .cse90 .cse91 .cse7)) (.cse5 (= (mod c_~var_1_9~0 256) 0)) (.cse2 (< (mod c_~var_1_11~0 4294967296) .cse40))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (< |c_ULTIMATE.start_step_#t~ite6#1| .cse4) .cse5 .cse2) (or .cse6 .cse7 (let ((.cse8 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse27 (< .cse40 1)) (.cse15 (< .cse8 .cse11)) (.cse22 (+ 65536 .cse13)) (.cse14 (mod (+ .cse77 56892) 65536))) (and (or (and (forall ((v_z_248 Int) (v_y_248 Int)) (let ((.cse9 (* 65536 v_y_248)) (.cse10 (* v_z_248 65535))) (let ((.cse12 (+ .cse14 .cse9 .cse10))) (or (< .cse8 (+ v_z_248 1)) (< (+ .cse9 .cse10) 0) (< v_z_248 .cse11) (= .cse12 .cse13) (< 65535 .cse12))))) (or .cse15 (forall ((v_y_250 Int) (v_z_250 Int)) (let ((.cse17 (* v_z_250 65535)) (.cse18 (* 65536 v_y_250))) (let ((.cse16 (+ .cse17 .cse14 .cse18))) (or (< 65535 .cse16) (< v_z_250 0) (< (+ .cse17 .cse18) 0) (= .cse16 .cse13) (< .cse13 v_z_250)))))) (or .cse15 (forall ((v_z_244 Int) (v_y_244 Int)) (let ((.cse19 (* 65536 v_y_244)) (.cse20 (* v_z_244 65535))) (let ((.cse21 (+ .cse14 .cse19 .cse20))) (or (< 65535 (+ .cse19 .cse20)) (= .cse21 .cse22) (< v_z_244 0) (< .cse21 65536) (< .cse13 v_z_244)))))) (forall ((v_z_246 Int) (v_y_246 Int)) (let ((.cse25 (* 65536 v_y_246)) (.cse26 (* v_z_246 65535))) (let ((.cse23 (+ .cse14 .cse25 .cse26)) (.cse24 (+ .cse25 .cse26))) (or (= .cse13 .cse23) (< .cse24 0) (= .cse23 .cse22) (< 65535 .cse24) (< v_z_246 .cse11) (< .cse8 (+ v_z_246 1)))))) (or .cse15 .cse27) (forall ((v_z_243 Int) (v_y_243 Int)) (let ((.cse29 (* 65536 v_y_243)) (.cse30 (* v_z_243 65535))) (let ((.cse28 (+ .cse29 .cse14 .cse30))) (or (< .cse28 65536) (< .cse8 (+ v_z_243 1)) (= .cse28 .cse22) (< 65535 (+ .cse29 .cse30)) (< v_z_243 .cse11))))) (or .cse15 (forall ((v_z_245 Int) (v_y_245 Int)) (let ((.cse33 (* 65536 v_y_245)) (.cse34 (* v_z_245 65535))) (let ((.cse31 (+ .cse14 .cse33 .cse34)) (.cse32 (+ .cse33 .cse34))) (or (= .cse31 .cse22) (< .cse32 0) (< v_z_245 0) (< .cse13 v_z_245) (= .cse31 .cse13) (< 65535 .cse32))))))) (= .cse35 .cse13) .cse36) (or .cse37 (and (or .cse15 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse38 (+ .cse41 v_z_234)) (.cse39 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (< 65535 .cse38) (< v_z_234 0) (< .cse13 .cse39) (= .cse38 .cse13) (< .cse39 .cse40))))) (forall ((v_z_234 Int)) (let ((.cse42 (+ .cse41 v_z_234))) (or (= .cse42 .cse22) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse43 (* 65536 v_y_234)) (.cse44 (* v_z_234 65535))) (let ((.cse45 (+ .cse43 .cse44))) (or (< .cse8 (+ .cse43 .cse44 1)) (< .cse45 .cse40) (< .cse45 .cse11))))) (< .cse42 65536)))) (forall ((v_z_234 Int)) (let ((.cse46 (+ .cse41 v_z_234))) (or (= .cse46 .cse22) (< v_z_234 0) (= .cse46 .cse13) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse47 (* 65536 v_y_234)) (.cse48 (* v_z_234 65535))) (let ((.cse49 (+ .cse47 .cse48))) (or (< .cse8 (+ .cse47 .cse48 1)) (< .cse49 .cse40) (< .cse49 .cse11)))))))) (or .cse15 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse51 (+ (* 65536 v_y_234) (* v_z_234 65535))) (.cse50 (+ .cse41 v_z_234))) (or (= .cse50 .cse22) (< .cse13 .cse51) (< 65535 v_z_234) (< .cse51 .cse40) (< .cse50 65536))))) (forall ((v_z_234 Int)) (let ((.cse52 (+ .cse41 v_z_234))) (or (< 65535 .cse52) (< v_z_234 0) (= .cse52 .cse13) (forall ((v_y_234 Int)) (let ((.cse53 (* 65536 v_y_234)) (.cse54 (* v_z_234 65535))) (let ((.cse55 (+ .cse53 .cse54))) (or (< .cse8 (+ .cse53 .cse54 1)) (< .cse55 .cse40) (< .cse55 .cse11)))))))) (or .cse15 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse56 (+ .cse41 v_z_234)) (.cse57 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (= .cse56 .cse22) (< v_z_234 0) (< .cse13 .cse57) (= .cse56 .cse13) (< 65535 v_z_234) (< .cse57 .cse40))))))) (or (and (or .cse15 .cse27 .cse37) (or (and (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse60 (* 65536 v_y_225)) (.cse61 (* v_z_225 65535))) (let ((.cse58 (+ .cse60 .cse61)) (.cse59 (+ .cse14 v_z_225))) (or (< .cse58 .cse11) (< .cse58 .cse40) (= .cse59 .cse22) (< 65535 v_z_225) (< .cse8 (+ .cse60 .cse61 1)) (< .cse59 65536))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse64 (* 65536 v_y_225)) (.cse65 (* v_z_225 65535))) (let ((.cse62 (+ .cse64 .cse65)) (.cse63 (+ .cse14 v_z_225))) (or (< .cse62 .cse11) (= .cse13 .cse63) (< .cse62 .cse40) (< v_z_225 0) (< .cse8 (+ .cse64 .cse65 1)) (< 65535 .cse63))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse68 (* 65536 v_y_225)) (.cse69 (* v_z_225 65535))) (let ((.cse66 (+ .cse68 .cse69)) (.cse67 (+ .cse14 v_z_225))) (or (< .cse66 .cse11) (= .cse13 .cse67) (< .cse66 .cse40) (< v_z_225 0) (= .cse67 .cse22) (< 65535 v_z_225) (< .cse8 (+ .cse68 .cse69 1)))))) (or .cse15 (and (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse71 (+ (* 65536 v_y_224) (* v_z_224 65535))) (.cse70 (+ .cse14 v_z_224))) (or (= .cse70 .cse13) (< .cse13 .cse71) (< .cse71 .cse40) (< v_z_224 0) (< 65535 .cse70)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse72 (+ .cse14 v_z_224)) (.cse73 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (= .cse72 .cse13) (< .cse13 .cse73) (= .cse72 .cse22) (< .cse73 .cse40) (< 65535 v_z_224) (< v_z_224 0)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse74 (+ .cse14 v_z_224)) (.cse75 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (< .cse74 65536) (< .cse13 .cse75) (= .cse74 .cse22) (< .cse75 .cse40) (< 65535 v_z_224))))))) .cse36)) (= .cse76 .cse13))))) .cse2) (or (< c_~var_1_13~0 .cse4) .cse3 .cse5 .cse2) (or (let ((.cse79 (= 0 .cse89))) (and (or .cse78 .cse79 .cse80) .cse81 (or (and (or (not .cse5) (and (<= .cse13 .cse82) (<= .cse83 .cse84))) .cse85) (and .cse79 (or (< .cse82 .cse13) (< .cse84 .cse83)) .cse5)) (or .cse79 .cse86 .cse87) .cse88)) (< (mod c_~var_1_17~0 4294967296) .cse40)) (or .cse3 (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse4) .cse5 .cse2) (or (and .cse0 (or .cse85 .cse7) .cse1) .cse5 .cse2))))))) is different from false [2023-12-20 20:38:07,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:11,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:14,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:16,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:20,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod c_~var_1_6~0 65536)) (.cse3 (* 65535 c_~var_1_5~0)) (.cse80 (* c_~var_1_6~0 65535)) (.cse81 (mod c_~var_1_4~0 65536)) (.cse16 (mod c_~var_1_5~0 65536))) (let ((.cse12 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse13 (let ((.cse82 (+ .cse16 c_~var_1_11~0)) (.cse83 (mod c_~var_1_16~0 65536))) (and (or (< .cse82 (+ .cse83 1)) (< (+ (* 65536 (div (+ (* (- 1) .cse16) .cse81) 65536)) c_~var_1_13~0 .cse16) .cse81)) (or (< .cse83 .cse82) (< (+ (* 65536 (div (+ (* (- 1) .cse83) .cse81 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse83) (+ .cse81 c_~var_1_11~0)))))) (.cse11 (mod (+ .cse3 .cse80 56892) 65536)) (.cse1 (< 56892 .cse81)) (.cse6 (< .cse81 56893)) (.cse8 (mod (+ .cse3 .cse80 c_~var_1_4~0) 65536)) (.cse14 (+ .cse16 1)) (.cse17 (< (mod c_~var_1_11~0 4294967296) .cse9))) (and (or (let ((.cse10 (mod c_~var_1_7~0 65536))) (let ((.cse7 (< .cse9 (+ .cse10 1))) (.cse2 (mod c_~var_1_1~0 65536))) (and (or (let ((.cse4 (* 65535 c_~var_1_7~0))) (let ((.cse0 (< .cse10 .cse9)) (.cse5 (= .cse2 (mod (+ .cse3 .cse4 56892) 65536)))) (and (or .cse0 .cse1 (= .cse2 (mod (+ .cse3 c_~var_1_4~0 .cse4) 65536))) (or (and (or .cse5 .cse0 .cse6) (or .cse1 .cse7)) (= .cse2 .cse8)) (or (and .cse5 (<= .cse9 .cse10)) (= .cse2 .cse11) .cse6)))) .cse12 .cse13) (or (not .cse12) (let ((.cse15 (= .cse2 .cse16))) (and (or (< .cse10 .cse14) .cse15 .cse7) (or (< .cse9 .cse14) (< .cse16 .cse10) .cse15))) .cse13)))) .cse17) (or .cse12 .cse13 (let ((.cse18 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse35 (< .cse9 1)) (.cse23 (< .cse18 .cse14)) (.cse30 (+ 65536 .cse16)) (.cse22 (mod (+ .cse3 56892) 65536))) (and (or (and (forall ((v_z_248 Int) (v_y_248 Int)) (let ((.cse19 (* 65536 v_y_248)) (.cse20 (* v_z_248 65535))) (let ((.cse21 (+ .cse22 .cse19 .cse20))) (or (< .cse18 (+ v_z_248 1)) (< (+ .cse19 .cse20) 0) (< v_z_248 .cse14) (= .cse21 .cse16) (< 65535 .cse21))))) (or .cse23 (forall ((v_y_250 Int) (v_z_250 Int)) (let ((.cse25 (* v_z_250 65535)) (.cse26 (* 65536 v_y_250))) (let ((.cse24 (+ .cse25 .cse22 .cse26))) (or (< 65535 .cse24) (< v_z_250 0) (< (+ .cse25 .cse26) 0) (= .cse24 .cse16) (< .cse16 v_z_250)))))) (or .cse23 (forall ((v_z_244 Int) (v_y_244 Int)) (let ((.cse27 (* 65536 v_y_244)) (.cse28 (* v_z_244 65535))) (let ((.cse29 (+ .cse22 .cse27 .cse28))) (or (< 65535 (+ .cse27 .cse28)) (= .cse29 .cse30) (< v_z_244 0) (< .cse29 65536) (< .cse16 v_z_244)))))) (forall ((v_z_246 Int) (v_y_246 Int)) (let ((.cse33 (* 65536 v_y_246)) (.cse34 (* v_z_246 65535))) (let ((.cse31 (+ .cse22 .cse33 .cse34)) (.cse32 (+ .cse33 .cse34))) (or (= .cse16 .cse31) (< .cse32 0) (= .cse31 .cse30) (< 65535 .cse32) (< v_z_246 .cse14) (< .cse18 (+ v_z_246 1)))))) (or .cse23 .cse35) (forall ((v_z_243 Int) (v_y_243 Int)) (let ((.cse37 (* 65536 v_y_243)) (.cse38 (* v_z_243 65535))) (let ((.cse36 (+ .cse37 .cse22 .cse38))) (or (< .cse36 65536) (< .cse18 (+ v_z_243 1)) (= .cse36 .cse30) (< 65535 (+ .cse37 .cse38)) (< v_z_243 .cse14))))) (or .cse23 (forall ((v_z_245 Int) (v_y_245 Int)) (let ((.cse41 (* 65536 v_y_245)) (.cse42 (* v_z_245 65535))) (let ((.cse39 (+ .cse22 .cse41 .cse42)) (.cse40 (+ .cse41 .cse42))) (or (= .cse39 .cse30) (< .cse40 0) (< v_z_245 0) (< .cse16 v_z_245) (= .cse39 .cse16) (< 65535 .cse40))))))) (= .cse11 .cse16) .cse6) (or .cse1 (let ((.cse45 (mod (+ .cse3 c_~var_1_4~0) 65536))) (and (or .cse23 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse43 (+ .cse45 v_z_234)) (.cse44 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (< 65535 .cse43) (< v_z_234 0) (< .cse16 .cse44) (= .cse43 .cse16) (< .cse44 .cse9))))) (forall ((v_z_234 Int)) (let ((.cse46 (+ .cse45 v_z_234))) (or (= .cse46 .cse30) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse47 (* 65536 v_y_234)) (.cse48 (* v_z_234 65535))) (let ((.cse49 (+ .cse47 .cse48))) (or (< .cse18 (+ .cse47 .cse48 1)) (< .cse49 .cse9) (< .cse49 .cse14))))) (< .cse46 65536)))) (forall ((v_z_234 Int)) (let ((.cse50 (+ .cse45 v_z_234))) (or (= .cse50 .cse30) (< v_z_234 0) (= .cse50 .cse16) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse51 (* 65536 v_y_234)) (.cse52 (* v_z_234 65535))) (let ((.cse53 (+ .cse51 .cse52))) (or (< .cse18 (+ .cse51 .cse52 1)) (< .cse53 .cse9) (< .cse53 .cse14)))))))) (or .cse23 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse55 (+ (* 65536 v_y_234) (* v_z_234 65535))) (.cse54 (+ .cse45 v_z_234))) (or (= .cse54 .cse30) (< .cse16 .cse55) (< 65535 v_z_234) (< .cse55 .cse9) (< .cse54 65536))))) (forall ((v_z_234 Int)) (let ((.cse56 (+ .cse45 v_z_234))) (or (< 65535 .cse56) (< v_z_234 0) (= .cse56 .cse16) (forall ((v_y_234 Int)) (let ((.cse57 (* 65536 v_y_234)) (.cse58 (* v_z_234 65535))) (let ((.cse59 (+ .cse57 .cse58))) (or (< .cse18 (+ .cse57 .cse58 1)) (< .cse59 .cse9) (< .cse59 .cse14)))))))) (or .cse23 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse60 (+ .cse45 v_z_234)) (.cse61 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (= .cse60 .cse30) (< v_z_234 0) (< .cse16 .cse61) (= .cse60 .cse16) (< 65535 v_z_234) (< .cse61 .cse9)))))))) (or (and (or .cse23 .cse35 .cse1) (or (and (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse64 (* 65536 v_y_225)) (.cse65 (* v_z_225 65535))) (let ((.cse62 (+ .cse64 .cse65)) (.cse63 (+ .cse22 v_z_225))) (or (< .cse62 .cse14) (< .cse62 .cse9) (= .cse63 .cse30) (< 65535 v_z_225) (< .cse18 (+ .cse64 .cse65 1)) (< .cse63 65536))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse68 (* 65536 v_y_225)) (.cse69 (* v_z_225 65535))) (let ((.cse66 (+ .cse68 .cse69)) (.cse67 (+ .cse22 v_z_225))) (or (< .cse66 .cse14) (= .cse16 .cse67) (< .cse66 .cse9) (< v_z_225 0) (< .cse18 (+ .cse68 .cse69 1)) (< 65535 .cse67))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse72 (* 65536 v_y_225)) (.cse73 (* v_z_225 65535))) (let ((.cse70 (+ .cse72 .cse73)) (.cse71 (+ .cse22 v_z_225))) (or (< .cse70 .cse14) (= .cse16 .cse71) (< .cse70 .cse9) (< v_z_225 0) (= .cse71 .cse30) (< 65535 v_z_225) (< .cse18 (+ .cse72 .cse73 1)))))) (or .cse23 (and (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse75 (+ (* 65536 v_y_224) (* v_z_224 65535))) (.cse74 (+ .cse22 v_z_224))) (or (= .cse74 .cse16) (< .cse16 .cse75) (< .cse75 .cse9) (< v_z_224 0) (< 65535 .cse74)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse76 (+ .cse22 v_z_224)) (.cse77 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (= .cse76 .cse16) (< .cse16 .cse77) (= .cse76 .cse30) (< .cse77 .cse9) (< 65535 v_z_224) (< v_z_224 0)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse78 (+ .cse22 v_z_224)) (.cse79 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (< .cse78 65536) (< .cse16 .cse79) (= .cse78 .cse30) (< .cse79 .cse9) (< 65535 v_z_224))))))) .cse6)) (= .cse8 .cse16))))) .cse17)))) is different from false [2023-12-20 20:38:33,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_5~0 65536))) (let ((.cse37 (mod c_~var_1_6~0 65536)) (.cse85 (* c_~var_1_6~0 65535)) (.cse3 (mod c_~var_1_4~0 65536)) (.cse84 (+ .cse2 c_~var_1_11~0)) (.cse5 (mod c_~var_1_16~0 65536)) (.cse74 (* 65535 c_~var_1_5~0))) (let ((.cse9 (+ .cse2 1)) (.cse38 (mod (+ .cse74 c_~var_1_4~0) 65536)) (.cse1 (< .cse84 (+ .cse5 1))) (.cse34 (< 56892 .cse3)) (.cse73 (mod (+ .cse74 .cse85 c_~var_1_4~0) 65536)) (.cse32 (mod (+ .cse74 .cse85 56892) 65536)) (.cse33 (< .cse3 56893)) (.cse0 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse4 (< .cse5 .cse84)) (.cse75 (< (mod c_~var_1_11~0 4294967296) .cse37))) (and (or .cse0 (and (or .cse1 (< (+ (* 65536 (div (+ (* (- 1) .cse2) .cse3) 65536)) c_~var_1_13~0 .cse2) .cse3)) (or .cse4 (< (+ (* 65536 (div (+ (* (- 1) .cse5) .cse3 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse5) (+ .cse3 c_~var_1_11~0)))) (let ((.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse24 (< .cse37 1)) (.cse12 (< .cse6 .cse9)) (.cse19 (+ 65536 .cse2)) (.cse11 (mod (+ .cse74 56892) 65536))) (and (or (and (forall ((v_z_248 Int) (v_y_248 Int)) (let ((.cse7 (* 65536 v_y_248)) (.cse8 (* v_z_248 65535))) (let ((.cse10 (+ .cse11 .cse7 .cse8))) (or (< .cse6 (+ v_z_248 1)) (< (+ .cse7 .cse8) 0) (< v_z_248 .cse9) (= .cse10 .cse2) (< 65535 .cse10))))) (or .cse12 (forall ((v_y_250 Int) (v_z_250 Int)) (let ((.cse14 (* v_z_250 65535)) (.cse15 (* 65536 v_y_250))) (let ((.cse13 (+ .cse14 .cse11 .cse15))) (or (< 65535 .cse13) (< v_z_250 0) (< (+ .cse14 .cse15) 0) (= .cse13 .cse2) (< .cse2 v_z_250)))))) (or .cse12 (forall ((v_z_244 Int) (v_y_244 Int)) (let ((.cse16 (* 65536 v_y_244)) (.cse17 (* v_z_244 65535))) (let ((.cse18 (+ .cse11 .cse16 .cse17))) (or (< 65535 (+ .cse16 .cse17)) (= .cse18 .cse19) (< v_z_244 0) (< .cse18 65536) (< .cse2 v_z_244)))))) (forall ((v_z_246 Int) (v_y_246 Int)) (let ((.cse22 (* 65536 v_y_246)) (.cse23 (* v_z_246 65535))) (let ((.cse20 (+ .cse11 .cse22 .cse23)) (.cse21 (+ .cse22 .cse23))) (or (= .cse2 .cse20) (< .cse21 0) (= .cse20 .cse19) (< 65535 .cse21) (< v_z_246 .cse9) (< .cse6 (+ v_z_246 1)))))) (or .cse12 .cse24) (forall ((v_z_243 Int) (v_y_243 Int)) (let ((.cse26 (* 65536 v_y_243)) (.cse27 (* v_z_243 65535))) (let ((.cse25 (+ .cse26 .cse11 .cse27))) (or (< .cse25 65536) (< .cse6 (+ v_z_243 1)) (= .cse25 .cse19) (< 65535 (+ .cse26 .cse27)) (< v_z_243 .cse9))))) (or .cse12 (forall ((v_z_245 Int) (v_y_245 Int)) (let ((.cse30 (* 65536 v_y_245)) (.cse31 (* v_z_245 65535))) (let ((.cse28 (+ .cse11 .cse30 .cse31)) (.cse29 (+ .cse30 .cse31))) (or (= .cse28 .cse19) (< .cse29 0) (< v_z_245 0) (< .cse2 v_z_245) (= .cse28 .cse2) (< 65535 .cse29))))))) (= .cse32 .cse2) .cse33) (or .cse34 (and (or .cse12 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse35 (+ .cse38 v_z_234)) (.cse36 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (< 65535 .cse35) (< v_z_234 0) (< .cse2 .cse36) (= .cse35 .cse2) (< .cse36 .cse37))))) (forall ((v_z_234 Int)) (let ((.cse39 (+ .cse38 v_z_234))) (or (= .cse39 .cse19) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse40 (* 65536 v_y_234)) (.cse41 (* v_z_234 65535))) (let ((.cse42 (+ .cse40 .cse41))) (or (< .cse6 (+ .cse40 .cse41 1)) (< .cse42 .cse37) (< .cse42 .cse9))))) (< .cse39 65536)))) (forall ((v_z_234 Int)) (let ((.cse43 (+ .cse38 v_z_234))) (or (= .cse43 .cse19) (< v_z_234 0) (= .cse43 .cse2) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse44 (* 65536 v_y_234)) (.cse45 (* v_z_234 65535))) (let ((.cse46 (+ .cse44 .cse45))) (or (< .cse6 (+ .cse44 .cse45 1)) (< .cse46 .cse37) (< .cse46 .cse9)))))))) (or .cse12 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse48 (+ (* 65536 v_y_234) (* v_z_234 65535))) (.cse47 (+ .cse38 v_z_234))) (or (= .cse47 .cse19) (< .cse2 .cse48) (< 65535 v_z_234) (< .cse48 .cse37) (< .cse47 65536))))) (forall ((v_z_234 Int)) (let ((.cse49 (+ .cse38 v_z_234))) (or (< 65535 .cse49) (< v_z_234 0) (= .cse49 .cse2) (forall ((v_y_234 Int)) (let ((.cse50 (* 65536 v_y_234)) (.cse51 (* v_z_234 65535))) (let ((.cse52 (+ .cse50 .cse51))) (or (< .cse6 (+ .cse50 .cse51 1)) (< .cse52 .cse37) (< .cse52 .cse9)))))))) (or .cse12 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse53 (+ .cse38 v_z_234)) (.cse54 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (= .cse53 .cse19) (< v_z_234 0) (< .cse2 .cse54) (= .cse53 .cse2) (< 65535 v_z_234) (< .cse54 .cse37))))))) (or (and (or .cse12 .cse24 .cse34) (or (and (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse57 (* 65536 v_y_225)) (.cse58 (* v_z_225 65535))) (let ((.cse55 (+ .cse57 .cse58)) (.cse56 (+ .cse11 v_z_225))) (or (< .cse55 .cse9) (< .cse55 .cse37) (= .cse56 .cse19) (< 65535 v_z_225) (< .cse6 (+ .cse57 .cse58 1)) (< .cse56 65536))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse61 (* 65536 v_y_225)) (.cse62 (* v_z_225 65535))) (let ((.cse59 (+ .cse61 .cse62)) (.cse60 (+ .cse11 v_z_225))) (or (< .cse59 .cse9) (= .cse2 .cse60) (< .cse59 .cse37) (< v_z_225 0) (< .cse6 (+ .cse61 .cse62 1)) (< 65535 .cse60))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse65 (* 65536 v_y_225)) (.cse66 (* v_z_225 65535))) (let ((.cse63 (+ .cse65 .cse66)) (.cse64 (+ .cse11 v_z_225))) (or (< .cse63 .cse9) (= .cse2 .cse64) (< .cse63 .cse37) (< v_z_225 0) (= .cse64 .cse19) (< 65535 v_z_225) (< .cse6 (+ .cse65 .cse66 1)))))) (or .cse12 (and (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse68 (+ (* 65536 v_y_224) (* v_z_224 65535))) (.cse67 (+ .cse11 v_z_224))) (or (= .cse67 .cse2) (< .cse2 .cse68) (< .cse68 .cse37) (< v_z_224 0) (< 65535 .cse67)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse69 (+ .cse11 v_z_224)) (.cse70 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (= .cse69 .cse2) (< .cse2 .cse70) (= .cse69 .cse19) (< .cse70 .cse37) (< 65535 v_z_224) (< v_z_224 0)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse71 (+ .cse11 v_z_224)) (.cse72 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (< .cse71 65536) (< .cse2 .cse72) (= .cse71 .cse19) (< .cse72 .cse37) (< 65535 v_z_224))))))) .cse33)) (= .cse73 .cse2))))) .cse75) (let ((.cse80 (mod c_~var_1_14~0 65536))) (or (let ((.cse76 (mod c_~var_1_7~0 65536))) (let ((.cse78 (< .cse37 (+ .cse76 1))) (.cse79 (mod c_~var_1_1~0 65536))) (and (or (not .cse0) (let ((.cse77 (= .cse79 .cse2))) (and (or (< .cse76 .cse9) .cse77 .cse78) (or (< .cse37 .cse9) (< .cse2 .cse76) .cse77)))) (or (= .cse38 .cse80) .cse1) (= 1 (mod c_~var_1_8~0 256)) (or (let ((.cse82 (* 65535 c_~var_1_7~0))) (let ((.cse81 (< .cse76 .cse37)) (.cse83 (= .cse79 (mod (+ .cse74 .cse82 56892) 65536)))) (and (or .cse81 .cse34 (= .cse79 (mod (+ .cse74 c_~var_1_4~0 .cse82) 65536))) (or (and (or .cse83 .cse81 .cse33) (or .cse34 .cse78)) (= .cse79 .cse73)) (or (and .cse83 (<= .cse37 .cse76)) (= .cse79 .cse32) .cse33)))) .cse0) (or .cse4 (= .cse80 (mod (+ c_~var_1_4~0 (* c_~var_1_16~0 65535) c_~var_1_11~0) 65536)))))) (< |c_ULTIMATE.start_step_~stepLocal_4~0#1| .cse80) (= (mod c_~var_1_9~0 256) 0) .cse75)))))) is different from false [2023-12-20 20:38:37,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:47,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:51,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:55,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:38:59,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:39:11,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:39:17,601 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 161 DAG size of output: 162 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:39:56,706 WARN L293 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 325 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:40:47,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:40:53,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:40:58,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:01,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:05,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:10,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:14,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:18,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:21,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:25,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:29,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:31,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:35,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:40,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-20 20:41:42,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-12-20 20:41:44,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:48,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:51,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:55,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:41:57,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:01,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:05,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:10,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:16,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:20,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:24,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:28,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:32,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:36,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:42:47,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:43:18,212 WARN L293 SmtUtils]: Spent 7.80s on a formula simplification that was a NOOP. DAG size: 282 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:43:20,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:43:24,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse55 (* 65535 c_~var_1_5~0)) (.cse85 (* c_~var_1_6~0 65535)) (.cse37 (mod c_~var_1_6~0 65536)) (.cse75 (mod c_~var_1_7~0 65536)) (.cse84 (mod c_~var_1_4~0 65536)) (.cse10 (mod c_~var_1_5~0 65536))) (let ((.cse8 (+ .cse10 1)) (.cse34 (< 56892 .cse84)) (.cse77 (< .cse37 (+ .cse75 1))) (.cse74 (mod (+ .cse55 .cse85 c_~var_1_4~0) 65536)) (.cse32 (mod (+ .cse55 .cse85 56892) 65536)) (.cse33 (< .cse84 56893)) (.cse78 (mod c_~var_1_1~0 65536)) (.cse4 (= (mod c_~last_1_var_1_8~0 256) 0)) (.cse3 (let ((.cse82 (+ .cse10 c_~var_1_11~0)) (.cse83 (mod c_~var_1_16~0 65536))) (and (or (< .cse82 (+ .cse83 1)) (< (+ (* 65536 (div (+ (* (- 1) .cse10) .cse84) 65536)) c_~var_1_13~0 .cse10) .cse84)) (or (< .cse83 .cse82) (< (+ (* 65536 (div (+ (* (- 1) .cse83) .cse84 c_~var_1_11~0) 65536)) c_~var_1_13~0 .cse83) (+ .cse84 c_~var_1_11~0))))))) (let ((.cse0 (or (let ((.cse80 (* 65535 c_~var_1_7~0))) (let ((.cse79 (< .cse75 .cse37)) (.cse81 (= .cse78 (mod (+ .cse55 .cse80 56892) 65536)))) (and (or .cse79 .cse34 (= .cse78 (mod (+ .cse55 c_~var_1_4~0 .cse80) 65536))) (or (and (or .cse81 .cse79 .cse33) (or .cse34 .cse77)) (= .cse78 .cse74)) (or (and .cse81 (<= .cse37 .cse75)) (= .cse78 .cse32) .cse33)))) .cse4 .cse3)) (.cse1 (or (not .cse4) (let ((.cse76 (= .cse78 .cse10))) (and (or (< .cse75 .cse8) .cse76 .cse77) (or (< .cse37 .cse8) (< .cse10 .cse75) .cse76))) .cse3)) (.cse2 (< (mod c_~var_1_11~0 4294967296) .cse37))) (and (or (and .cse0 .cse1) .cse2) (or (and .cse0 (or (= 1 (mod c_~var_1_8~0 256)) .cse3) .cse1) (= (mod c_~var_1_9~0 256) 0) .cse2) (or .cse4 (not (= (mod |c_ULTIMATE.start_step_~stepLocal_0~0#1| 256) 0)) .cse3 (let ((.cse5 (mod |c_ULTIMATE.start_step_~stepLocal_1~0#1| 65536))) (let ((.cse24 (< .cse37 1)) (.cse12 (< .cse5 .cse8)) (.cse19 (+ 65536 .cse10)) (.cse11 (mod (+ .cse55 56892) 65536))) (and (or (and (forall ((v_z_248 Int) (v_y_248 Int)) (let ((.cse6 (* 65536 v_y_248)) (.cse7 (* v_z_248 65535))) (let ((.cse9 (+ .cse11 .cse6 .cse7))) (or (< .cse5 (+ v_z_248 1)) (< (+ .cse6 .cse7) 0) (< v_z_248 .cse8) (= .cse9 .cse10) (< 65535 .cse9))))) (or .cse12 (forall ((v_y_250 Int) (v_z_250 Int)) (let ((.cse14 (* v_z_250 65535)) (.cse15 (* 65536 v_y_250))) (let ((.cse13 (+ .cse14 .cse11 .cse15))) (or (< 65535 .cse13) (< v_z_250 0) (< (+ .cse14 .cse15) 0) (= .cse13 .cse10) (< .cse10 v_z_250)))))) (or .cse12 (forall ((v_z_244 Int) (v_y_244 Int)) (let ((.cse16 (* 65536 v_y_244)) (.cse17 (* v_z_244 65535))) (let ((.cse18 (+ .cse11 .cse16 .cse17))) (or (< 65535 (+ .cse16 .cse17)) (= .cse18 .cse19) (< v_z_244 0) (< .cse18 65536) (< .cse10 v_z_244)))))) (forall ((v_z_246 Int) (v_y_246 Int)) (let ((.cse22 (* 65536 v_y_246)) (.cse23 (* v_z_246 65535))) (let ((.cse20 (+ .cse11 .cse22 .cse23)) (.cse21 (+ .cse22 .cse23))) (or (= .cse10 .cse20) (< .cse21 0) (= .cse20 .cse19) (< 65535 .cse21) (< v_z_246 .cse8) (< .cse5 (+ v_z_246 1)))))) (or .cse12 .cse24) (forall ((v_z_243 Int) (v_y_243 Int)) (let ((.cse26 (* 65536 v_y_243)) (.cse27 (* v_z_243 65535))) (let ((.cse25 (+ .cse26 .cse11 .cse27))) (or (< .cse25 65536) (< .cse5 (+ v_z_243 1)) (= .cse25 .cse19) (< 65535 (+ .cse26 .cse27)) (< v_z_243 .cse8))))) (or .cse12 (forall ((v_z_245 Int) (v_y_245 Int)) (let ((.cse30 (* 65536 v_y_245)) (.cse31 (* v_z_245 65535))) (let ((.cse28 (+ .cse11 .cse30 .cse31)) (.cse29 (+ .cse30 .cse31))) (or (= .cse28 .cse19) (< .cse29 0) (< v_z_245 0) (< .cse10 v_z_245) (= .cse28 .cse10) (< 65535 .cse29))))))) (= .cse32 .cse10) .cse33) (or .cse34 (let ((.cse38 (mod (+ .cse55 c_~var_1_4~0) 65536))) (and (or .cse12 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse35 (+ .cse38 v_z_234)) (.cse36 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (< 65535 .cse35) (< v_z_234 0) (< .cse10 .cse36) (= .cse35 .cse10) (< .cse36 .cse37))))) (forall ((v_z_234 Int)) (let ((.cse39 (+ .cse38 v_z_234))) (or (= .cse39 .cse19) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse40 (* 65536 v_y_234)) (.cse41 (* v_z_234 65535))) (let ((.cse42 (+ .cse40 .cse41))) (or (< .cse5 (+ .cse40 .cse41 1)) (< .cse42 .cse37) (< .cse42 .cse8))))) (< .cse39 65536)))) (forall ((v_z_234 Int)) (let ((.cse43 (+ .cse38 v_z_234))) (or (= .cse43 .cse19) (< v_z_234 0) (= .cse43 .cse10) (< 65535 v_z_234) (forall ((v_y_234 Int)) (let ((.cse44 (* 65536 v_y_234)) (.cse45 (* v_z_234 65535))) (let ((.cse46 (+ .cse44 .cse45))) (or (< .cse5 (+ .cse44 .cse45 1)) (< .cse46 .cse37) (< .cse46 .cse8)))))))) (or .cse12 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse48 (+ (* 65536 v_y_234) (* v_z_234 65535))) (.cse47 (+ .cse38 v_z_234))) (or (= .cse47 .cse19) (< .cse10 .cse48) (< 65535 v_z_234) (< .cse48 .cse37) (< .cse47 65536))))) (forall ((v_z_234 Int)) (let ((.cse49 (+ .cse38 v_z_234))) (or (< 65535 .cse49) (< v_z_234 0) (= .cse49 .cse10) (forall ((v_y_234 Int)) (let ((.cse50 (* 65536 v_y_234)) (.cse51 (* v_z_234 65535))) (let ((.cse52 (+ .cse50 .cse51))) (or (< .cse5 (+ .cse50 .cse51 1)) (< .cse52 .cse37) (< .cse52 .cse8)))))))) (or .cse12 (forall ((v_z_234 Int) (v_y_234 Int)) (let ((.cse53 (+ .cse38 v_z_234)) (.cse54 (+ (* 65536 v_y_234) (* v_z_234 65535)))) (or (= .cse53 .cse19) (< v_z_234 0) (< .cse10 .cse54) (= .cse53 .cse10) (< 65535 v_z_234) (< .cse54 .cse37)))))))) (or (and (or .cse12 .cse24 .cse34) (or (and (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse58 (* 65536 v_y_225)) (.cse59 (* v_z_225 65535))) (let ((.cse56 (+ .cse58 .cse59)) (.cse57 (+ .cse11 v_z_225))) (or (< .cse56 .cse8) (< .cse56 .cse37) (= .cse57 .cse19) (< 65535 v_z_225) (< .cse5 (+ .cse58 .cse59 1)) (< .cse57 65536))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse62 (* 65536 v_y_225)) (.cse63 (* v_z_225 65535))) (let ((.cse60 (+ .cse62 .cse63)) (.cse61 (+ .cse11 v_z_225))) (or (< .cse60 .cse8) (= .cse10 .cse61) (< .cse60 .cse37) (< v_z_225 0) (< .cse5 (+ .cse62 .cse63 1)) (< 65535 .cse61))))) (forall ((v_z_225 Int) (v_y_225 Int)) (let ((.cse66 (* 65536 v_y_225)) (.cse67 (* v_z_225 65535))) (let ((.cse64 (+ .cse66 .cse67)) (.cse65 (+ .cse11 v_z_225))) (or (< .cse64 .cse8) (= .cse10 .cse65) (< .cse64 .cse37) (< v_z_225 0) (= .cse65 .cse19) (< 65535 v_z_225) (< .cse5 (+ .cse66 .cse67 1)))))) (or .cse12 (and (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse69 (+ (* 65536 v_y_224) (* v_z_224 65535))) (.cse68 (+ .cse11 v_z_224))) (or (= .cse68 .cse10) (< .cse10 .cse69) (< .cse69 .cse37) (< v_z_224 0) (< 65535 .cse68)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse70 (+ .cse11 v_z_224)) (.cse71 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (= .cse70 .cse10) (< .cse10 .cse71) (= .cse70 .cse19) (< .cse71 .cse37) (< 65535 v_z_224) (< v_z_224 0)))) (forall ((v_z_224 Int) (v_y_224 Int)) (let ((.cse72 (+ .cse11 v_z_224)) (.cse73 (+ (* 65536 v_y_224) (* v_z_224 65535)))) (or (< .cse72 65536) (< .cse10 .cse73) (= .cse72 .cse19) (< .cse73 .cse37) (< 65535 v_z_224))))))) .cse33)) (= .cse74 .cse10))))) .cse2))))) is different from false [2023-12-20 20:43:27,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-20 20:43:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:43:38,231 INFO L93 Difference]: Finished difference Result 956 states and 1448 transitions. [2023-12-20 20:43:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-20 20:43:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2023-12-20 20:43:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:43:38,237 INFO L225 Difference]: With dead ends: 956 [2023-12-20 20:43:38,238 INFO L226 Difference]: Without dead ends: 804 [2023-12-20 20:43:38,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2438 ImplicationChecksByTransitivity, 226.8s TimeCoverageRelationStatistics Valid=998, Invalid=5640, Unknown=20, NotChecked=652, Total=7310 [2023-12-20 20:43:38,241 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 925 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 29 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 159.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 161.3s IncrementalHoareTripleChecker+Time [2023-12-20 20:43:38,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1345 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1190 Invalid, 28 Unknown, 63 Unchecked, 161.3s Time] [2023-12-20 20:43:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2023-12-20 20:43:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 245. [2023-12-20 20:43:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 162 states have internal predecessors, (204), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:43:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 340 transitions. [2023-12-20 20:43:38,264 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 340 transitions. Word has length 216 [2023-12-20 20:43:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:43:38,265 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 340 transitions. [2023-12-20 20:43:38,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:43:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 340 transitions. [2023-12-20 20:43:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-20 20:43:38,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:43:38,267 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:43:38,275 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-20 20:43:38,474 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-20 20:43:38,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:43:38,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:43:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1247684893, now seen corresponding path program 1 times [2023-12-20 20:43:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:43:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868684322] [2023-12-20 20:43:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:43:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:43:38,492 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:43:38,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454775903] [2023-12-20 20:43:38,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:43:38,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:43:38,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:43:38,493 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-20 20:43:38,496 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-20 20:43:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:43:38,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-20 20:43:38,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:43:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:43:41,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:43:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:43:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868684322] [2023-12-20 20:43:41,582 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:43:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454775903] [2023-12-20 20:43:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454775903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:43:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:43:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 20:43:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785755069] [2023-12-20 20:43:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:43:41,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 20:43:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:43:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 20:43:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-20 20:43:41,583 INFO L87 Difference]: Start difference. First operand 245 states and 340 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:43:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:43:42,707 INFO L93 Difference]: Finished difference Result 553 states and 797 transitions. [2023-12-20 20:43:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 20:43:42,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2023-12-20 20:43:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:43:42,711 INFO L225 Difference]: With dead ends: 553 [2023-12-20 20:43:42,711 INFO L226 Difference]: Without dead ends: 379 [2023-12-20 20:43:42,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2023-12-20 20:43:42,712 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 307 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 20:43:42,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 939 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 20:43:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-12-20 20:43:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 245. [2023-12-20 20:43:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 162 states have internal predecessors, (204), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:43:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 340 transitions. [2023-12-20 20:43:42,732 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 340 transitions. Word has length 216 [2023-12-20 20:43:42,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:43:42,732 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 340 transitions. [2023-12-20 20:43:42,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:43:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 340 transitions. [2023-12-20 20:43:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-20 20:43:42,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:43:42,733 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:43:42,741 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-20 20:43:42,941 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-20 20:43:42,941 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:43:42,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:43:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1869083634, now seen corresponding path program 1 times [2023-12-20 20:43:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:43:42,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124751850] [2023-12-20 20:43:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:43:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:43:42,961 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:43:42,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199108753] [2023-12-20 20:43:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:43:42,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:43:42,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:43:42,963 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-20 20:43:42,987 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-20 20:43:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:43:43,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 20:43:43,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:43:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:43:43,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 20:43:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:43:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124751850] [2023-12-20 20:43:43,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:43:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199108753] [2023-12-20 20:43:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199108753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 20:43:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 20:43:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 20:43:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395451878] [2023-12-20 20:43:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:43:43,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 20:43:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:43:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 20:43:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 20:43:43,112 INFO L87 Difference]: Start difference. First operand 245 states and 340 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:43:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:43:43,164 INFO L93 Difference]: Finished difference Result 397 states and 556 transitions. [2023-12-20 20:43:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 20:43:43,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2023-12-20 20:43:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:43:43,166 INFO L225 Difference]: With dead ends: 397 [2023-12-20 20:43:43,166 INFO L226 Difference]: Without dead ends: 247 [2023-12-20 20:43:43,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 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-20 20:43:43,167 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 82 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 20:43:43,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 366 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 20:43:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-20 20:43:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2023-12-20 20:43:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 162 states have (on average 1.2530864197530864) internal successors, (203), 162 states have internal predecessors, (203), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:43:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 339 transitions. [2023-12-20 20:43:43,184 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 339 transitions. Word has length 217 [2023-12-20 20:43:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:43:43,184 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 339 transitions. [2023-12-20 20:43:43,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:43:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2023-12-20 20:43:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-20 20:43:43,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:43:43,186 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:43:43,193 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-20 20:43:43,391 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-20 20:43:43,391 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:43:43,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:43:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1610918196, now seen corresponding path program 1 times [2023-12-20 20:43:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:43:43,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180550049] [2023-12-20 20:43:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:43:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:43:43,408 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:43:43,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2075646042] [2023-12-20 20:43:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:43:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:43:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:43:43,410 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-20 20:43:43,437 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-20 20:43:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:43:43,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-20 20:43:43,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:43:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1193 proven. 489 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2023-12-20 20:43:59,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:44:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2023-12-20 20:44:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:44:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180550049] [2023-12-20 20:44:33,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:44:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075646042] [2023-12-20 20:44:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075646042] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 20:44:33,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 20:44:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [40] total 53 [2023-12-20 20:44:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296462106] [2023-12-20 20:44:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 20:44:33,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-20 20:44:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:44:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-20 20:44:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2269, Unknown=0, NotChecked=0, Total=2756 [2023-12-20 20:44:33,948 INFO L87 Difference]: Start difference. First operand 245 states and 339 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:44:44,125 WARN L293 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 145 DAG size of output: 142 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:45:11,411 WARN L293 SmtUtils]: Spent 7.51s on a formula simplification. DAG size of input: 169 DAG size of output: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 20:45:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 20:45:53,168 INFO L93 Difference]: Finished difference Result 1011 states and 1497 transitions. [2023-12-20 20:45:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-20 20:45:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2023-12-20 20:45:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 20:45:53,172 INFO L225 Difference]: With dead ends: 1011 [2023-12-20 20:45:53,172 INFO L226 Difference]: Without dead ends: 861 [2023-12-20 20:45:53,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3388 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=1196, Invalid=8116, Unknown=0, NotChecked=0, Total=9312 [2023-12-20 20:45:53,175 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1776 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-20 20:45:53,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 1220 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-20 20:45:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-12-20 20:45:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 286. [2023-12-20 20:45:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 203 states have internal predecessors, (264), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-20 20:45:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2023-12-20 20:45:53,201 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 217 [2023-12-20 20:45:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 20:45:53,201 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2023-12-20 20:45:53,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2023-12-20 20:45:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2023-12-20 20:45:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-20 20:45:53,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 20:45:53,202 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 20:45:53,210 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-20 20:45:53,412 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-20 20:45:53,414 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 20:45:53,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 20:45:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2009513835, now seen corresponding path program 1 times [2023-12-20 20:45:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 20:45:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462386752] [2023-12-20 20:45:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:45:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 20:45:53,437 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 20:45:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352615816] [2023-12-20 20:45:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 20:45:53,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 20:45:53,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 20:45:53,438 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-20 20:45:53,441 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-20 20:45:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 20:45:53,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-20 20:45:53,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 20:45:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1191 proven. 414 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2023-12-20 20:45:55,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 20:46:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 102 proven. 363 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2023-12-20 20:46:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 20:46:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462386752] [2023-12-20 20:46:00,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 20:46:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352615816] [2023-12-20 20:46:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352615816] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 20:46:00,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 20:46:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-12-20 20:46:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768159216] [2023-12-20 20:46:00,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 20:46:00,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-20 20:46:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 20:46:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-20 20:46:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2023-12-20 20:46:00,964 INFO L87 Difference]: Start difference. First operand 286 states and 400 transitions. Second operand has 45 states, 45 states have (on average 2.7777777777777777) internal successors, (125), 44 states have internal predecessors, (125), 12 states have call successors, (67), 7 states have call predecessors, (67), 16 states have return successors, (68), 11 states have call predecessors, (68), 12 states have call successors, (68) Received shutdown request... [2023-12-20 20:46:07,227 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 20:46:07,260 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 20:46:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-20 20:46:07,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2078, Invalid=8224, Unknown=0, NotChecked=0, Total=10302 [2023-12-20 20:46:07,296 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 1180 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-20 20:46:07,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1035 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-20 20:46:07,297 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 20:46:07,303 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-20 20:46:07,502 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-20 20:46:07,504 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (286states) and FLOYD_HOARE automaton (currently 72 states, 45 states before enhancement),while ReachableStatesComputation was computing reachable states (409 states constructed, input type IntersectNwa). [2023-12-20 20:46:07,507 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 20:46:07,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 20:46:07,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 08:46:07 BoogieIcfgContainer [2023-12-20 20:46:07,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 20:46:07,510 INFO L158 Benchmark]: Toolchain (without parser) took 863681.56ms. Allocated memory was 253.8MB in the beginning and 987.8MB in the end (delta: 734.0MB). Free memory was 203.2MB in the beginning and 559.3MB in the end (delta: -356.1MB). Peak memory consumption was 378.7MB. Max. memory is 8.0GB. [2023-12-20 20:46:07,510 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 20:46:07,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.00ms. Allocated memory is still 253.8MB. Free memory was 202.9MB in the beginning and 186.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-20 20:46:07,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.29ms. Allocated memory is still 253.8MB. Free memory was 186.4MB in the beginning and 181.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 20:46:07,511 INFO L158 Benchmark]: Boogie Preprocessor took 72.88ms. Allocated memory is still 253.8MB. Free memory was 181.6MB in the beginning and 173.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-20 20:46:07,511 INFO L158 Benchmark]: RCFGBuilder took 482.64ms. Allocated memory is still 253.8MB. Free memory was 173.5MB in the beginning and 204.0MB in the end (delta: -30.5MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. [2023-12-20 20:46:07,511 INFO L158 Benchmark]: TraceAbstraction took 862755.09ms. Allocated memory was 253.8MB in the beginning and 987.8MB in the end (delta: 734.0MB). Free memory was 202.9MB in the beginning and 559.3MB in the end (delta: -356.4MB). Peak memory consumption was 378.1MB. Max. memory is 8.0GB. [2023-12-20 20:46:07,512 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.11ms. Allocated memory is still 210.8MB. Free memory is still 161.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.00ms. Allocated memory is still 253.8MB. Free memory was 202.9MB in the beginning and 186.4MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.29ms. Allocated memory is still 253.8MB. Free memory was 186.4MB in the beginning and 181.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.88ms. Allocated memory is still 253.8MB. Free memory was 181.6MB in the beginning and 173.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 482.64ms. Allocated memory is still 253.8MB. Free memory was 173.5MB in the beginning and 204.0MB in the end (delta: -30.5MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. * TraceAbstraction took 862755.09ms. Allocated memory was 253.8MB in the beginning and 987.8MB in the end (delta: 734.0MB). Free memory was 202.9MB in the beginning and 559.3MB in the end (delta: -356.4MB). Peak memory consumption was 378.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (286states) and FLOYD_HOARE automaton (currently 72 states, 45 states before enhancement),while ReachableStatesComputation was computing reachable states (409 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 862.7s, OverallIterations: 13, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 612.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 7177 SdHoareTripleChecker+Valid, 280.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7169 mSDsluCounter, 8925 SdHoareTripleChecker+Invalid, 277.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 63 IncrementalHoareTripleChecker+Unchecked, 7124 mSDsCounter, 531 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7399 IncrementalHoareTripleChecker+Invalid, 8032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 531 mSolverCounterUnsat, 1801 mSDtfsCounter, 7399 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4319 GetRequests, 3842 SyntacticMatches, 1 SemanticMatches, 476 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 12772 ImplicationChecksByTransitivity, 418.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=12, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 2082 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 244.7s InterpolantComputationTime, 3023 NumberOfCodeBlocks, 3023 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4087 ConstructedInterpolants, 2 QuantifiedInterpolants, 73653 SizeOfPredicates, 164 NumberOfNonLiveVariables, 6327 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 39849/42636 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: Timeout Completed graceful shutdown